1277 search results - page 176 / 256 » Terminating Decision Algorithms Optimally |
134
Voted
CIKM
2005
Springer
15 years 9 months ago
2005
Springer
With this work we aim to make a three-fold contribution. We first address the issue of supporting efficiently queries over string-attributes involving prefix, suffix, containmen...
123
Voted
COR
2002
15 years 3 months ago
2002
The overall aim of this study is to show that there is a critical interface between the lot sizing and tool management decisions, and these two problems cannot be viewed in isolat...
161
Voted
TACAS
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. We extend the setting of Satisfiability Modulo Theories (SMT) by introducing a theory of costs C, where it is possible to model and reason about resource consumption and ...
142
Voted
FOCS
2008
IEEE
15 years 4 months ago
2008
IEEE
Given a universe U of n elements and a weighted collection S of m subsets of U, the universal set cover problem is to a-priori map each element u ∈ U to a set S(u) ∈ S contain...
124
Voted
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...