10051 search results - page 278 / 2011 » A Dynamic Separator Algorithm |
185
click to vote
ECAI
2008
Springer
15 years 8 months ago
2008
Springer
We propose a new algorithm for solving Distributed Constraint Optimization Problems (DCOPs). Our algorithm, called DyBop, is based on branch and bound search with dynamic ordering ...
137
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Continuing in the steps of Jon Kleinberg's and others celebrated work on decentralized search, we conduct an experimental analysis of destination sampling, a dynamic algorithm...
189
Voted
STOC
2006
ACM
16 years 7 months ago
2006
ACM
We present a new data structure that facilitates approximate nearest neighbor searches on a dynamic set of points in a metric space that has a bounded doubling dimension. Our data...
140
Voted
ICRA
2007
IEEE
16 years 1 months ago
2007
IEEE
— We present a sampling-based path planning and replanning algorithm that produces anytime solutions. Our algorithm tunes the quality of its result based on available search time...
148
click to vote
SUTC
2006
IEEE
16 years 21 days ago
2006
IEEE
In this paper, we propose an adaptive hybrid dynamic power management (AH-DPM) strategy based on a predictive shutdown scheme and an adaptive non-stationary stochastic process. Th...