5316 search results - page 886 / 1064 » Which Search Problems Are Random |
106
click to vote
ATAL
2009
Springer
15 years 11 months ago
2009
Springer
In context-aware route planning, a set of agents has to plan routes on a common infrastructure and each agent has to plan a conflict-free route from a source to a destination wit...
154
click to vote
WADS
2007
Springer
15 years 10 months ago
2007
Springer
Let G = (V, E) be an weighted undirected graph on n vertices and m edges, and let dG be its shortest path metric. We present two simple deterministic algorithms for approximating ...
123
click to vote
SIGECOM
2003
ACM
15 years 9 months ago
2003
ACM
Often, an outcome must be chosen on the basis of the preferences reported by a group of agents. The key difficulty is that the agents may report their preferences insincerely to m...
147
click to vote
COMPGEOM
2010
ACM
15 years 9 months ago
2010
ACM
We present a simple randomized scheme for triangulating a set P of n points in the plane, and construct a kinetic data structure which maintains the triangulation as the points of...
174
click to vote
SIGGRAPH
1997
ACM
15 years 8 months ago
1997
ACM
We present a new Monte Carlo method for solving the light transport problem, inspired by the Metropolis sampling method in computational physics. To render an image, we generate a...