706 search results - page 89 / 142 » Super Solutions in Constraint Programming |
EUROGP
1999
Springer
15 years 4 months ago
1999
Springer
In this paper we describe how the Stepwise Adaptation of Weights (saw) technique can be applied in genetic programming. The saw-ing mechanism has been originally developed for and ...
APPROX
2010
Springer
15 years 1 months ago
2010
Springer
In this paper, we investigate whether a constant round Lasserre Semi-definite Programming (SDP) relaxation might give a good approximation to the UNIQUE GAMES problem. We show tha...
DAGSTUHL
2007
15 years 1 months ago
2007
We consider one-round games between a classical verifier and two provers who share entanglement. We show that when the constraints enforced by the verifier are ‘unique’ cons...
CCE
2004
14 years 11 months ago
2004
We consider the dynamic optimization of chemical processes with changes in the number of equilibrium phases. Recent work has shown that transitions in the number of phases can be ...
100
click to vote
WIOPT
2010
IEEE
14 years 9 months ago
2010
IEEE
We consider the resource allocation (RA) problem of maximizing the weighted sum of the minimal user rates (WSMR) of coordinated cells subject to a total power constraint at each ba...