805 search results - page 111 / 161 » Enumerating All Solutions for Constraint Satisfaction Proble... |
120
click to vote
PATAT
2000
Springer
15 years 8 months ago
2000
Springer
The main aim of this paper is to consider university examination timetabling problems as multicriteria decision problems. A new multicriteria approach to solving such problems is p...
127
click to vote
CP
2004
Springer
15 years 9 months ago
2004
Springer
We combine mixed integer linear programming (MILP) and constraint programming (CP) to solve planning and scheduling problems. Tasks are allocated to facilities using MILP and sche...
129
click to vote
PUK
2000
15 years 5 months ago
2000
In a real planning problem, there exists a set of constraints (both temporal constraints and resource usage constraints) which must be satisfied in order to obtain a feasible plan....
159
click to vote
CIIA
2009
15 years 5 months ago
2009
Vertical partition is an important technique in database design used to enhance performance in database systems. Vertical fragmentation is a combinatorial optimization problem that...
155
click to vote
PODS
2007
ACM
16 years 4 months ago
2007
ACM
The generalized hypertree width GHW(H) of a hypergraph H is a measure of its cyclicity. Classes of conjunctive queries or constraint satisfaction problems whose associated hypergr...