84 search results - page 16 / 17 » Parallel Iterative A* Search: An Admissible Distributed Heur... |
EUROPAR
2009
Springer
14 years 21 days ago
2009
Springer
Selecting a random peer with uniform probability across a peer-to-peer (P2P) network is a fundamental function for unstructured search, data replication, and monitoring algorithms....
ICS
2007
Tsinghua U.
14 years 9 days ago
2007
Tsinghua U.
Increased complexity of memory systems to ameliorate the gap between the speed of processors and memory has made it increasingly harder for compilers to optimize an arbitrary code...
DCOSS
2010
Springer
13 years 8 months ago
2010
Springer
Jamming attacks are especially harmful when ensuring the dependability of wireless communication. Finding the position of a jammer will enable the network to actively exploit a wid...
IPPS
2007
IEEE
14 years 13 days ago
2007
IEEE
— This paper introduces the Abstract Data and Communication Library (ADCL). ADCL is an application level communication library aiming at providing the highest possible performanc...
GECCO
2006
Springer
13 years 9 months ago
2006
Springer
The most popular approaches for reconstructing phylogenetic trees attempt to solve NP-hard optimization criteria such as maximum parsimony (MP). Currently, the bestperforming heur...