Sciweavers

13376 search results - page 266 / 2676
» Problem Solving with
Sort
View
118
Voted
MP
2006
93views more  MP 2006»
15 years 3 months ago
Computation of Error Bounds for P-matrix Linear Complementarity Problems
Abstract We give new error bounds for the linear complementarity problem where the involved matrix is a P-matrix. Computation of rigorous error bounds can be turned into a P-matrix...
Xiaojun Chen, Shuhuang Xiang
AIPS
2006
15 years 5 months ago
Structure and Problem Hardness: Goal Asymmetry and DPLL Proofs in SAT-Based Planning
In AI Planning, as well as Verification, a successful method is to compile the application into boolean satisfiability (SAT), and solve it with state-of-the-art DPLL-based procedu...
Jörg Hoffmann, Carla P. Gomes, Bart Selman
147
Voted
ENDM
2010
127views more  ENDM 2010»
15 years 3 months ago
MPQ-trees for orthogonal packing problem
Finding a feasible solution for a bi-dimensional Orthogonal Packing Problem (OPP2) consists in deciding whether a set of rectangular boxes (items) can be packed in a "big&quo...
Cédric Joncour, Arnaud Pêcher, Petru ...
DSS
2007
122views more  DSS 2007»
15 years 3 months ago
A stochastic beam search for the berth allocation problem
Abstract. In this paper, the optimization of the Berth Allocation Problem (BAP) is transformed into a multiple stage decision making procedure and a new stochastic beam search algo...
Fan Wang, Andrew Lim
JSCIC
2010
81views more  JSCIC 2010»
14 years 10 months ago
A Tailored Finite Point Method for Convection-Diffusion-Reaction Problems
We study a tailored finite point method (TFPM) for solving the convection-diffusion-reaction equation. The solution basis functions for the TFPM are constructed for a 5 point, 7 p...
Yintzer Shih, R. Bruce Kellogg, Peishan Tsai