559 search results - page 26 / 112 » Fast SDP Algorithms for Constraint Satisfaction Problems |
125
click to vote
ECAI
2004
Springer
15 years 8 months ago
2004
Springer
Super solutions are a mechanism to provide robustness to constraint programs [10]. They are solutions in which, if a small number of variables lose their values, we are guaranteed ...
129
click to vote
CP
2001
Springer
15 years 8 months ago
2001
Springer
The Constraint Problems usually addressed fall into one of two models: the Constraint Satisfaction Problem (CSP) and the Constraint Optimization Problem (COP). However, in many rea...
116
Voted
GECCO
2005
Springer
15 years 9 months ago
2005
Springer
This paper proposes an incremental approach for building solutions using evolutionary computation. It presents a simple evolutionary model called a Transition model in which parti...
118
Voted
TSP
2010
14 years 10 months ago
2010
This paper considers the downlink beamforming optimization problem that minimizes the total transmission power subject to global shaping constraints and individual shaping constrai...
119
click to vote
CSR
2006
Springer
15 years 7 months ago
2006
Springer
We classify the computational complexity of all constraint satisfaction problems where the constraint language is preserved by all permutations of the domain. A constraint languag...