Sciweavers

1596 search results - page 5 / 320
» Human-Guided Simple Search
Sort
View
STACS
2005
Springer
15 years 3 months ago
Worst-Case and Average-Case Approximations by Simple Randomized Search Heuristics
Abstract. In recent years, probabilistic analyses of algorithms have received increasing attention. Despite results on the average-case complexity and smoothed complexity of exact ...
Carsten Witt
CP
2005
Springer
15 years 3 months ago
Solving Simple Planning Problems with More Inference and No Search
Many problems used in AI planning including Blocks, Logistics, Gripper, Satellite, and others lack the interactions that characterize puzzles and can be solved nonoptimally in low...
Vincent Vidal, Hector Geffner
SODA
2004
ACM
155views Algorithms» more  SODA 2004»
14 years 11 months ago
Navigating nets: simple algorithms for proximity search
d Abstract] Robert Krauthgamer James R. Lee We present a simple deterministic data structure for maintaining a set S of points in a general metric space, while supporting proximit...
Robert Krauthgamer, James R. Lee
WADS
1993
Springer
136views Algorithms» more  WADS 1993»
15 years 1 months ago
Balanced Search Trees Made Simple
Abstract. As a contribution to the recent debate on simple implementations of dictionaries, we present new maintenancealgorithms for balanced trees. In terms of code simplicity, ou...
Arne Andersson
INFOCOM
2009
IEEE
15 years 4 months ago
Absence of Evidence as Evidence of Absence: A Simple Mechanism for Scalable P2P Search
Abstract—We propose a novel search mechanism for unstructured p2p networks, and show that it is both scalable, i.e., it leads to a bounded query traffic load per peer as the pee...
Stratis Ioannidis, Peter Marbach