Kód: 13788299
This book provide an efficient way to find intervals between partial co-clones through supercomputer. It utilizes computer hardware characteristics, and Prune and search algorithm to search problem size up to O(2 to the power of 8 ... celý popis
Nákupem získáte 53 bodů
This book provide an efficient way to find intervals between partial co-clones through supercomputer. It utilizes computer hardware characteristics, and Prune and search algorithm to search problem size up to O(2 to the power of 80). This algorithm uses little memory with linear complexity, and almost no communication between computing nodes. It is a fast, light-weighted tool for researchers who has many relatively small partial clone related problems.
531 Kč
Osobní odběr Praha, Brno a 12903 dalších
Copyright ©2008-24 nejlevnejsi-knihy.cz Všechna práva vyhrazenaSoukromíCookies
Nákupní košík ( prázdný )