844 search results - page 80 / 169 » Solving the p |
168
click to vote
WG
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. Assume that each vertex of a graph G is assigned a nonnegative integer weight and that l and u are nonnegative integers. One wish to partition G into connected components...
155
click to vote
ICTAI
1999
IEEE
15 years 10 months ago
1999
IEEE
Recently, there has been much interest in enhancing purely combinatorial formalisms with numerical information. For example, planning formalisms can be enriched by taking resource...
148
click to vote
ATAL
2006
Springer
15 years 9 months ago
2006
Springer
We present a new polynomial-space algorithm for solving Distributed Constraint Optimization problems (DCOP). The algorithm, called NCBB, is branch and bound search with modificati...
173
click to vote
ECAI
2004
Springer
15 years 9 months ago
2004
Springer
Quantified Constraint Satisfaction Problems (QCSPs) are CSPs in which some variables are universally quantified. For each possible value of such variables, we have to find ways to ...
141
click to vote
GECCO
2006
Springer
15 years 9 months ago
2006
Springer
In this paper we compare Mixed-Integer Evolution Strategies (MI-ES) and standard Evolution Strategies (ES) when applied to find optimal solutions for artificial test problems and ...