Sciweavers

600 search results - page 3 / 120
» Solving Distributed Constraint Optimization Problems Using L...
Sort
View
SAT
2007
Springer
95views Hardware» more  SAT 2007»
14 years 2 months ago
Solving Multi-objective Pseudo-Boolean Problems
Integer Linear Programs are widely used in areas such as routing problems, scheduling analysis and optimization, logic synthesis, and partitioning problems. As many of these proble...
Martin Lukasiewycz, Michael Glaß, Christian ...
JAIR
2008
121views more  JAIR 2008»
13 years 8 months ago
A Constraint Programming Approach for Solving a Queueing Control Problem
In a facility with front room and back room operations, it is useful to switch workers between the rooms in order to cope with changing customer demand. Assuming stochastic custom...
Daria Terekhov, J. Christopher Beck
DAC
2006
ACM
14 years 9 months ago
Optimization of area under a delay constraint in digital filter synthesis using SAT-based integer linear programming
In this paper, we propose an exact algorithm for the problem of area optimization under a delay constraint in the synthesis of multiplierless FIR filters. To the best of our knowl...
Eduardo A. C. da Costa, José Monteiro, Leve...
AAAI
2007
13 years 11 months ago
Solving a Stochastic Queueing Design and Control Problem with Constraint Programming
A facility with front room and back room operations has the option of hiring specialized or, more expensive, cross-trained workers. Assuming stochastic customer arrival and servic...
Daria Terekhov, J. Christopher Beck, Kenneth N. Br...
WLP
2004
Springer
14 years 1 months ago
Effective Modeling with Constraints
Constraint programming provides a declarative approach to solving combinatorial (optimization) problems. The user just states the problem as a constraint satisfaction problem (CSP)...
Roman Barták