90 search results - page 7 / 18 » A swarm based approximated algorithm to the extended general... |
STOC
2009
ACM
14 years 8 months ago
2009
ACM
We consider the stochastic Steiner forest problem: suppose we were given a collection of Steiner forest instances, and were guaranteed that a random one of these instances would a...
NIPS
2007
13 years 8 months ago
2007
We present a novel message passing algorithm for approximating the MAP problem in graphical models. The algorithm is similar in structure to max-product but unlike max-product it ...
CPAIOR
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. The NValue constraint counts the number of different values assigned to a vector of variables. Propagating generalized arc consistency on this constraint is NP-hard. We ...
APPROX
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. Scheduling jobs on unrelated parallel machines so as to minimize the makespan is one of the basic, well-studied problems in the area of machine scheduling. In the first ...
GECCO
2011
Springer
12 years 11 months ago
2011
Springer
In continuous optimisation, surrogate models (SMs) are used when tackling real-world problems whose candidate solutions are expensive to evaluate. In previous work, we showed that...