Sciweavers

2543 search results - page 2 / 509
» Optimal Ordered Problem Solver
Sort
View
AIPS
2008
13 years 9 months ago
The Complexity of Optimal Planning and a More Efficient Method for Finding Solutions
We present a faster method of solving optimal planning problems and show that our solution performs up to an order of magnitude faster than Satplan on a variety of problems from t...
Katrina Ray, Matthew L. Ginsberg
CP
2005
Springer
14 years 14 days ago
Solving Large-Scale Nonlinear Programming Problems by Constraint Partitioning
Abstract. In this paper, we present a constraint-partitioning approach for finding local optimal solutions of large-scale mixed-integer nonlinear programming problems (MINLPs). Ba...
Benjamin W. Wah, Yixin Chen
CONSTRAINTS
2010
126views more  CONSTRAINTS 2010»
13 years 4 months ago
Solving satisfiability problems with preferences
Abstract. Propositional satisfiability (SAT) is a success story in Computer Science and Artificial Intelligence: SAT solvers are currently used to solve problems in many different ...
Emanuele Di Rosa, Enrico Giunchiglia, Marco Marate...
ICCS
2004
Springer
14 years 9 days ago
A Fast Multifrontal Solver for Non-linear Multi-physics Problems
The paper presents a highly optimized implementation of a multifrontal solver for linear systems arising in the FEM simulation of multi-physics problems related to the behaviour of...
Alberto Bertoldo, Mauro Bianco, Geppino Pucci
DATE
2007
IEEE
80views Hardware» more  DATE 2007»
14 years 1 months ago
A new hybrid solution to boost SAT solver performance
Due to the widespread demands for efficient SAT solvers in Electronic Design Automation applications, methods to boost the performance of the SAT solver are highly desired. We pr...
Lei Fang, Michael S. Hsiao