5316 search results - page 82 / 1064 » Which Search Problems Are Random |
123
click to vote
STOC
2003
ACM
16 years 1 months ago
2003
ACM
Many algorithms and data structures employing hashing have been analyzed under the uniform hashing assumption, i.e., the assumption that hash functions behave like truly random fu...
110
click to vote
KI
2001
Springer
15 years 5 months ago
2001
Springer
Abstract Coordinating the motion of multiple mobile robots is one of the fundamental problems in robotics. The predominant algorithms for coordinating teams of robots are decoupled...
111
click to vote
RAS
2002
15 years 24 days ago
2002
Coordinating the motion of multiple mobile robots is one of the fundamental problems in robotics. The predominant algorithms for coordinating teams of robots are decoupled and pri...
GECCO
2005
Springer
15 years 6 months ago
2005
Springer
In this work we provide empirical evidence that shows how a variable-length genetic algorithm (GA) can naturally evolve shorter average size populations. This reduction in chromos...
124
click to vote
CDC
2009
IEEE
14 years 11 months ago
2009
IEEE
Abstract-- The problem of finding the eigenvector corresponding to the largest eigenvalue of a stochastic matrix has numerous applications in ranking search results, multi-agent co...