808 search results - page 34 / 162 » A scaling algorithm for polynomial constraint satisfaction p... |
123
Voted
AIPS
2006
15 years 5 months ago
2006
In this paper we describe the problem of Optimal Competitive Scheduling, which consists of activities that compete for a shared resource. The objective is to choose a subset of ac...
170
Voted
SAC
2006
ACM
15 years 3 months ago
2006
ACM
Interactive configuration guides a user searching through a large combinatorial space of solutions to a system of constraints. We investigate a class of very expressive underlying...
111
Voted
GECCO
2007
Springer
15 years 10 months ago
2007
Springer
Forma analysis provides an approach to formally derive domain specific operators based on domain-independent operator templates by manipulating a set of equivalence relations (i....
131
Voted
COCOON
2005
Springer
15 years 9 months ago
2005
Springer
We study the edge-connectivity survivable network design problem with an additional linear budget constraint. We give a strongly polynomial time (3, 3)-approximation algorithm for ...
142
Voted
AAAI
1994
15 years 5 months ago
1994
Many real-life Constraint Satisfaction Problems (CSPs) involve some constraints similar to the alldifferent constraints. These constraints are called constraints of difference. Th...