4117 search results - page 275 / 824 » On the Satisfiability of Complex Constraints |
188
click to vote
ISSS
1999
IEEE
15 years 11 months ago
1999
IEEE
This paper presents a real-time task scheduling technique with a variable voltage processor which can vary its supply voltage dynamically. Using such a processor, running tasks wi...
166
Voted
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...
158
click to vote
CEC
2007
IEEE
15 years 10 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 ...
165
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...
180
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...