1421 search results - page 136 / 285 » Satisfying KBO Constraints |
172
click to vote
ICTAI
1996
IEEE
15 years 11 months ago
1996
IEEE
In many applications, such as decision support, negotiation, planning, scheduling, etc., one needs to express requirements that can only be partially satisfied. In order to expres...
170
Voted
CEC
2007
IEEE
15 years 11 months ago
2007
IEEE
We present a memetic algorithm that dynamically optimizes the design of a wireless sensor network towards energy conservation and extension of the life span of the network, taking ...
173
click to vote
CP
2008
Springer
15 years 8 months ago
2008
Springer
Backbone variables have the same assignment in all solutions to a given constraint satisfaction problem; more generally, bias represents the proportion of solutions that assign a v...
191
click to vote
APPROX
2010
Springer
15 years 8 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...
162
Voted
SPLC
2008
15 years 8 months ago
2008
NASA is, with the rest of industry, turning to product-line engineering to reduce costs and improve quality by effectively managing reuse. Experience in industry has shown that it...