Sciweavers

481 search results - page 11 / 97
» Anytime Local Search for Distributed Constraint Optimization
Sort
View
AI
2006
Springer
13 years 10 months ago
Cut-and-solve: An iterative search strategy for combinatorial optimization problems
Branch-and-bound and branch-and-cut use search trees to identify optimal solutions to combinatorial optimization problems. In this paper, we introduce an iterative search strategy...
Sharlee Climer, Weixiong Zhang
ICASSP
2011
IEEE
13 years 2 months ago
A combinatorial optimization framework for subset selection in distributed multiple-radar architectures
Abstract—Widely distributed multiple radar architectures offer parameter estimation improvement for target localization. For a large number of radars, the achievable localization...
Hana Godrich, Athina P. Petropulu, H. Vincent Poor
ICTAI
2007
IEEE
14 years 5 months ago
Hypergraph Partitioning for Exploiting Localities in Nonlinear Constrained Optimization
In this paper, we present a new hypergraph partitioning algorithm that jointly optimizes the number of hyperedge cuts and the number of shared vertices in nonlinear constrained op...
Benjamin W. Wah, Soomin Lee
SODA
2004
ACM
124views Algorithms» more  SODA 2004»
14 years 4 days ago
Family trees: an ordered dictionary with optimal congestion, locality, degree, and search time
We consider the problem of storing an ordered dictionary data structure over a distributed set of nodes. In contrast to traditional sequential data structures, distributed data st...
Kevin C. Zatloukal, Nicholas J. A. Harvey
CEC
2010
IEEE
13 years 2 months ago
Co-evolutionary search path planning under constrained information-sharing for a cooperative unmanned aerial vehicle team
—Mobile cooperative sensor networks are increasingly used for surveillance and reconnaissance tasks to support domain picture compilation. However, efficient distributed informat...
Jean Berger, Jens Happe