Sciweavers

4266 search results - page 253 / 854
» The container loading problem
Sort
View
ICCBR
2009
Springer
16 years 1 months ago
An Active Approach to Automatic Case Generation
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 ...
Michael W. Floyd, Babak Esfandiari
GBRPR
2007
Springer
16 years 21 days ago
Approximating TSP Solution by MST Based Graph Pyramid
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...
Yll Haxhimusa, Walter G. Kropatsch, Zygmunt Pizlo,...
CP
2003
Springer
15 years 11 months ago
Cost-Based Filtering for Shorter Path Constraints
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...
Meinolf Sellmann
DATE
2010
IEEE
126views Hardware» more  DATE 2010»
15 years 11 months ago
Leveraging dominators for preprocessing QBF
— 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...
Hratch Mangassarian, Bao Le, Alexandra Goultiaeva,...
ECAI
2000
Springer
15 years 11 months ago
A Framework for Dynamic Constraint Reasoning using Procedural Constraints
Many complex real-world decision problems, such as planning, contain an underlying constraint reasoning problem. The feasibility of a solution candidate then depends on the consis...
Ari K. Jónsson, Jeremy Frank