190 search results - page 16 / 38 » Improved Algorithm for the Soft Global Cardinality Constrain... |
IJCAI
2001
14 years 11 months ago
2001
The algorithm presented here, BCC, is an enhancement of the well known Backtrack used to solve constraint satisfaction problems. Though most backtrack improvements rely on propaga...
RTSS
2000
IEEE
15 years 1 months ago
2000
IEEE
Many industrial applications with real-time demands are composed of mixed sets of tasks with a variety of requirements. These can be in the form of standard timing constraints, su...
DATE
2002
IEEE
15 years 2 months ago
2002
IEEE
Optimizing power consumption at high-level is a critical step towards power-efficient digital system designs. This paper addresses the power management problem by scheduling a giv...
75
Voted
CP
2001
Springer
15 years 2 months ago
2001
Springer
In recent years, many works have been carried out to solve over-constrained problems, and more speci cally the Maximal Constraint Satisfaction Problem (Max-CSP), where the goal is ...
102
click to vote
CONSTRAINTS
2010
14 years 9 months ago
2010
Abstract. We describe a simple CSP formalism for handling multi-attribute preference problems with hard constraints, one that combines hard constraints and preferences so the two a...