Sciweavers

942 search results - page 149 / 189
» Cooperating Constraint Solvers
Sort
View
AIPS
2000
13 years 9 months ago
DPPlan: An Algorithm for Fast Solutions Extraction from a Planning Graph
Themostefficient planning algorithms recently developed are mainly based on Graphplansystem or on satisfiability approach. In this paper wepresent a new approach to plan generatio...
Marco Baioletti, Stefano Marcugini, Alfredo Milani
AIPS
2010
13 years 8 months ago
Forward-Chaining Partial-Order Planning
Over the last few years there has been a revival of interest in the idea of least-commitment planning with a number of researchers returning to the partial-order planning approach...
Amanda Jane Coles, Andrew Coles, Maria Fox, Derek ...
SMA
2010
ACM
164views Solid Modeling» more  SMA 2010»
13 years 8 months ago
Topologically guaranteed univariate solutions of underconstrained polynomial systems via no-loop and single-component tests
We present an algorithm which robustly computes the intersection curve(s) of an under-constrained piecewise polynomial system consisting of n equations with n + 1 unknowns. The so...
Michael Barton, Gershon Elber, Iddo Hanniel
CCE
2008
13 years 8 months ago
Chance constrained programming approach to process optimization under uncertainty
Deterministic optimization approaches have been well developed and widely used in the process industry to accomplish off-line and on-line process optimization. The challenging tas...
Pu Li, Harvey Arellano-Garcia, Günter Wozny
ENTCS
2008
105views more  ENTCS 2008»
13 years 8 months ago
Declaring Numbers
Most implementations of functional and functional logic languages treat numbers and the basic numeric operations as external entities. The main reason for this is efficiency. Howe...
Bernd Braßel, Sebastian Fischer, Frank Huch