Sciweavers

14649 search results - page 345 / 2930
» Principles of problem solving
Sort
View
AAAI
2004
15 years 8 months ago
Domain Transmutation in Constraint Satisfaction Problems
We study local interchangeability of values in constraint networks based on a new approach where a single value in the domain of a variable can be treated as a combination of &quo...
James Bowen, Chavalit Likitvivatanavong
AIPS
2006
15 years 8 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
FLAIRS
2001
15 years 8 months ago
Practical Modeling of Bayesian Decision Problems -- Exploiting Deterministic Relations
Thewidespreaduse of influence diagramsto represent andsolve Bayesiandecision problemsis still limited by the inflexibility andrather restrictive semanticsof influence diagrams. In...
Anders L. Madsen, Kristian G. Olesen, Søren...
ENDM
2010
127views more  ENDM 2010»
15 years 6 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 ...
145
Voted
DSS
2007
122views more  DSS 2007»
15 years 6 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