717 search results - page 79 / 144 » Weak-Commitment Search for Solving Constraint Satisfaction P... |
CPAIOR
2005
Springer
15 years 3 months ago
2005
Springer
The Employee Timetabling Problem (ETP) is a general class of problems widely encountered in service organizations (such as call centers for instance). Given a set of activities, a ...
122
click to vote
CPAIOR
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. We propose a hybrid approach for solving the resource-constrained project scheduling problem which is an extremely hard to solve combinatorial optimization problem of pra...
CP
2008
Springer
14 years 11 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...
AAAI
1997
14 years 11 months ago
1997
The problem of counting the number of solutions to a constraint satisfaction problem (CSP) is rephrased in terms of probability updating in Bayes networks. Approximating the proba...
CPAIOR
2010
Springer
15 years 2 months ago
2010
Springer
We introduce an approach which combines ACO (Ant Colony Optimization) and IBM ILOG CP Optimizer for solving COPs (Combinatorial Optimization Problems). The problem is modeled using...