5316 search results - page 190 / 1064 » Which Search Problems Are Random |
116
click to vote
SWAT
2004
Springer
15 years 9 months ago
2004
Springer
We present improved cache-oblivious data structures and algorithms for breadth-first search and the single-source shortest path problem on undirected graphs with non-negative edge...
135
click to vote
GLOBECOM
2007
IEEE
15 years 10 months ago
2007
IEEE
—As data rates in the Internet increase, the Internet Protocol (IP) address lookup is required to be resolved in shorter resolution times. IP address lookup involves finding the...
149
click to vote
IROS
2007
IEEE
15 years 10 months ago
2007
IEEE
— One primary goal in rescue robotics is to deploy a team of robots for coordinated victim search after a disaster. This requires robots to perform subtasks, such as victim detec...
135
Voted
ISAAC
2003
Springer
15 years 9 months ago
2003
Springer
We propose a new lattice reduction method. Our algorithm approximates shortest lattice vectors up to a factor ≤ (k/6)n/2k and makes use of Grover’s quantum search algorithm. Th...
149
click to vote
ATAL
2008
Springer
15 years 5 months ago
2008
Springer
We define the class of games called simulation-based games, in which the payoffs are available as an output of an oracle (simulator), rather than specified analytically or using a...