1480 search results - page 217 / 296 » Ants can solve constraint satisfaction problems |
156
click to vote
IPSN
2005
Springer
15 years 12 months ago
2005
Springer
— We consider the problem of energy efficient random deployment of sensor network. Our goal is to find the sensor node density, or alternatively, the energy resource density at e...
146
click to vote
CDC
2009
IEEE
15 years 11 months ago
2009
IEEE
— Given an arbitrary network of interconnected nodes, each with an initial value from a discrete set, we consider the problem of distributively disseminating these initial values...
149
click to vote
AIPS
1998
15 years 7 months ago
1998
Casting planning problems as propositional satis ability problems has recently been shown to be an effective way of scaling up plan synthesis. Until now, the bene ts of this appro...
170
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
: A local search algorithm operating on an instance of a Boolean constraint satisfaction problem (in particular, k-SAT) can be viewed as a stochastic process traversing successive ...
197
click to vote
CEC
2008
IEEE
16 years 27 days ago
2008
IEEE
— Many deterministic algorithms in the context of constrained optimization require the first-order derivatives, or the gradient vectors, of the objective and constraint function...