Sciweavers

26 search results - page 2 / 6
» Solution Equivalent Subquadrangle Reformulations of Constrai...
Sort
View
ICPPW
2009
IEEE
13 years 4 months ago
Global Multiprocessor Real-Time Scheduling as a Constraint Satisfaction Problem
In this paper we address the problem of global real-time periodic scheduling on heterogeneous multiprocessor platforms. We give a solution based on a constraint satisfaction proble...
Liliana Cucu-Grosjean, Olivier Buffet
AAAI
2004
13 years 8 months ago
Domain Transmutation in Constraint Satisfaction Problems
We study local interchangeability of values in constraint networks based on a new approach where a single value in the domain of a variable can be treated as a combination of &quo...
James Bowen, Chavalit Likitvivatanavong
AAAI
1998
13 years 8 months ago
On the Conversion between Non-Binary and Binary Constraint Satisfaction Problems
It is well known that any non-binary discrete constraint satisfaction problem (CSP) can be translated into an equivalent binary CSP. Two translations are known: the dual graph tra...
Fahiem Bacchus, Peter van Beek
NETWORKS
2008
13 years 7 months ago
Reformulation and sampling to solve a stochastic network interdiction problem
The Network Interdiction Problem involves interrupting an adversary's ability to maximize flow through a capacitated network by destroying portions of the network. A budget c...
Udom Janjarassuk, Jeff Linderoth
CPAIOR
2004
Springer
14 years 13 days ago
Super Solutions in Constraint Programming
To improve solution robustness, we introduce the concept of super solutions to constraint programming. An (a, b)-super solution is one in which if a variables lose their values, th...
Emmanuel Hebrard, Brahim Hnich, Toby Walsh