4229 search results - page 354 / 846 » On the Optimality of Spiral Search |
232
click to vote
APPROX
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. We give a (ln n + 1)-approximation for the decision tree (DT) problem. An instance of DT is a set of m binary tests T = (T1, . . . , Tm) and a set of n items X = (X1, . ....
146
click to vote
ATAL
2008
Springer
15 years 8 months ago
2008
Springer
Physical agents (such as wheeled vehicles, UAVs, hovercraft, etc.) with simple control systems are often sensitive to changes in their physical design and control parameters. As s...
152
click to vote
AAAI
2010
15 years 8 months ago
2010
In cooperative pathfinding problems, non-interfering paths that bring each agent from its current state to its goal state must be planned for multiple agents. We present the first...
182
click to vote
IJCAI
2007
15 years 8 months ago
2007
In distributed combinatorial optimization problems, dynamic programming algorithms like DPOP ([Petcu and Faltings, 2005]) require only a linear number of messages, thus generating...
178
click to vote
CIIT
2004
15 years 8 months ago
2004
This paper shows the design and performance of an AQM (Active Queue Management) enabled router. The design is based on a classical proportional control system. The application of ...