16091 search results - page 109 / 3219 » Solving |
IFIP
2004
Springer
14 years 1 months ago
2004
Springer
We study the general packing problem with M constraints. In [Jansen and Zhang, TCS 2002] a c(1 + ε)-approximation algorithm for the general packing problem was proposed. A block s...
PATAT
2004
Springer
14 years 1 months ago
2004
Springer
Timetabling problems have been frequently studied due to their wide range of applications. However, they are often solved manually because of the lack of appropriate computer tools...
ICRA
2003
IEEE
14 years 1 months ago
2003
IEEE
— Given a set of affine varieties in ℜ3, i.e. planes, lines, and points, the problem tackled in this paper is that of finding all possible configurations for these varieties...
KCAP
2003
ACM
14 years 1 months ago
2003
ACM
In this paper we describe a generic library of problemsolving methods (PSMs) for scheduling applications. Although, some attempts have been made in the past at developing librarie...
CP
2003
Springer
14 years 1 months ago
2003
Springer
Abstract. This paper offers a critique of the framework of Constraint Satisfaction Problems. While this framework has been successful in studying search techniques, and has inspire...