Sciweavers

464 search results - page 38 / 93
» Distributed Constraint-Based Local Search
Sort
View
COMPGEOM
2006
ACM
14 years 1 months ago
Lower bounds on locality sensitive hashing
Given a metric space (X, dX), c ≥ 1, r > 0, and p, q ∈ [0, 1], a distribution over mappings H : X → N is called a (r, cr, p, q)-sensitive hash family if any two points in...
Rajeev Motwani, Assaf Naor, Rina Panigrahy
ATAL
2005
Springer
14 years 1 months ago
How local is that optimum? k-optimality for DCOP
In multi-agent systems where sets of joint actions (JAs) are generated, metrics are needed to evaluate these sets and efficiently allocate resources for the many JAs. For the case...
Jonathan P. Pearce, Rajiv T. Maheswaran, Milind Ta...
ISER
2004
Springer
173views Robotics» more  ISER 2004»
14 years 1 months ago
Synergies in Feature Localization by Air-Ground Robot Teams
Abstract. This paper describes the implementation of a decentralized architecture for autonomous teams of aerial and ground vehicles engaged in active perception. We provide a theo...
Ben Grocholsky, Selcuk Bayraktar, Vijay Kumar, Cam...
IPL
2002
119views more  IPL 2002»
13 years 7 months ago
Randomized splay trees: Theoretical and experimental results
Splay trees are self-organizing binary search trees that were introduced by Sleator and Tarjan [12]. In this paper we present a randomized variant of these trees. The new algorith...
Susanne Albers, Marek Karpinski
IPM
2007
156views more  IPM 2007»
13 years 7 months ago
p2pDating: Real life inspired semantic overlay networks for Web search
We consider a network of autonomous peers forming a logically global but physically distributed search engine, where every peer has its own local collection generated by independe...
Josiane Xavier Parreira, Sebastian Michel, Gerhard...