481 search results - page 24 / 97 » Anytime Local Search for Distributed Constraint Optimization |
DCC
2011
IEEE
14 years 5 months ago
2011
IEEE
The effect of quantization of prior probabilities in a collection of distributed Bayesian binary hypothesis testing problems over which the priors themselves vary is studied. In ...
DCC
2007
IEEE
15 years 9 months ago
2007
IEEE
We develop a simulated annealing technique to jointly optimize a distributed quantization structure meant to maximize the asymptotic error exponent of a downstream classifier or d...
85
Voted
ICRA
2006
IEEE
15 years 4 months ago
2006
IEEE
— We address the problem of placing a sensor network so as to minimize the uncertainty in estimating the position of targets. The novelty of our formulation is in the sensing mod...
106
Voted
ENTCS
2007
14 years 9 months ago
2007
We suggest a formal model to represent and solve the multicast routing problem in multicast networks. To attain this, we model the network adapting it to a weighted and-or graph, ...
ECAI
2006
Springer
15 years 1 months ago
2006
Springer
Some of the most successful algorithms for satisfiability, such as Walksat, are based on random walks. Similarly, local search algorithms for solving constraint optimization proble...