5316 search results - page 904 / 1064 » Which Search Problems Are Random |
135
click to vote
IPPS
2010
IEEE
15 years 2 months ago
2010
IEEE
Abstract--A hybrid MPI/Pthreads parallelization was implemented in the RAxML phylogenetics code. New MPI code was added to the existing Pthreads production code to exploit parallel...
167
click to vote
SIGMOD
2012
ACM
13 years 6 months ago
2012
ACM
Locality-Sensitive Hashing (LSH) and its variants are wellknown methods for solving the c-approximate NN Search problem in high-dimensional space. Traditionally, several LSH funct...
165
click to vote
CIKM
2007
Springer
15 years 10 months ago
2007
Springer
As a promising new technology with the unique properties like high efficiency, scalability and fault tolerance, Peer-toPeer (P2P) technology is used as the underlying network to b...
153
click to vote
ECCC
2010
15 years 1 months ago
2010
We consider the reachability problem for a certain class of directed acyclic graphs embedded on surfaces. Let G(m, g) be the class of directed acyclic graphs with m = m(n) source ...
148
click to vote
ATAL
2009
Springer
15 years 11 months ago
2009
Springer
Multiagent systems are often characterized by complex, and sometimes unpredictable interactions amongst their autonomous components. While these systems can provide robust and sca...