8647 search results - page 516 / 1730 » The Container Selection Problem |
201
click to vote
STOC
2009
ACM
16 years 7 months ago
2009
ACM
This paper studies constant-time approximation algorithms for problems on degree-bounded graphs. Let n and d be the number of vertices and the degree bound, respectively. This pap...
172
click to vote
ICCBR
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. When learning by observing an expert, cases can be automatically generated in an inexpensive manner. However, since this is a passive method of learning the observer has ...
165
click to vote
GBRPR
2007
Springer
16 years 1 months ago
2007
Springer
The traveling salesperson problem (TSP) is difficult to solve for input instances with large number of cities. Instead of finding the solution of an input with a large number of c...
220
click to vote
CP
2003
Springer
16 years 6 days ago
2003
Springer
Abstract. Many real world problems, e.g. personnel scheduling and transportation planning, can be modeled naturally as Constrained Shortest Path Problems (CSPPs), i.e., as Shortest...
162
click to vote
DATE
2010
IEEE
16 years 2 days ago
2010
IEEE
— Many CAD for VLSI problems can be naturally encoded as Quantified Boolean Formulas (QBFs) and solved with QBF solvers. Furthermore, such problems often contain circuitbased in...