805 search results - page 67 / 161 » Enumerating All Solutions for Constraint Satisfaction Proble... |
130
click to vote
CPAIOR
2005
Springer
15 years 10 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 ...
153
click to vote
ALGORITHMICA
2007
15 years 4 months ago
2007
Abstract Many compiler optimization techniques depend on the ability to calculate the number of elements that satisfy certain conditions. If these conditions can be represented by ...
150
click to vote
PPDP
2010
Springer
15 years 2 months ago
2010
Springer
The presence of uncertainty in the real world makes robustness to be a desired property of solutions to constraint satisfaction problems. Roughly speaking, a solution is robust if...
118
click to vote
IAT
2008
IEEE
15 years 11 months ago
2008
IEEE
The process of creating e-learning contents using reusable learning objects (LOs) can be broken down in two sub-processes: LOs finding and LO sequencing. Although semiautomatic to...
115
click to vote
ESA
2009
Springer
15 years 11 months ago
2009
Springer
In this paper we show that iterative rounding is a powerful and flexible tool in the design of approximation algorithms for multiobjective optimization problems. We illustrate tha...