559 search results - page 45 / 112 » Fast SDP Algorithms for Constraint Satisfaction Problems |
105
Voted
NOMS
2000
IEEE
15 years 7 months ago
2000
IEEE
Communication networks are expected to offer a wide range of services to an increasingly large number of users, with a diverse range of quality of service. This calls for efficien...
125
Voted
CEC
2005
IEEE
15 years 8 months ago
2005
IEEE
Abstract- This paper proposes an evolutionary approach for the composition of solutions in an incremental way. The approach is based on the metaphor of transitions in complexity di...
118
Voted
CP
1998
Springer
15 years 7 months ago
1998
Springer
A well-studied problem in the electric power industry is that of optimally scheduling preventative maintenance of power generating units within a power plant. We show how these pr...
125
Voted
AIPS
1994
15 years 4 months ago
1994
An intelligent problem solver must be able to decompose a complex problem into simpler parts. A decomposition algorithm would not only be bene cial for traditional subgoal-oriente...
216
Voted
CP
2009
Springer
16 years 3 months ago
2009
Springer
The Valued Constraint Satisfaction Problem (VCSP) is a general framework encompassing many optimisation problems. We discuss precisely what it means for a problem to be modelled in...