42 search results - page 8 / 9 » Programmed Search in a Timetabling Problem over Finite Domai... |
AIPS
2010
13 years 6 months ago
2010
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...
TOOLS
2000
IEEE
13 years 10 months ago
2000
IEEE
In this experience report we present a case study in designing, implementing, and reusing an object-oriented framework for constructing and editing complex search expressions over...
ICALP
2005
Springer
13 years 11 months ago
2005
Springer
Motivated by the study of algorithmic problems in the domain of information security, in this paper, we study the complexity of a new class of computations over a collection of va...
CPAIOR
2008
Springer
13 years 7 months ago
2008
Springer
We present a propagator that achieves MDD consistency for a separable equality over an MDD (multivalued decision diagram) store in pseudo-polynomial time. We integrate the propagat...
CORR
2008
Springer
13 years 5 months ago
2008
Springer
Abstract--In this paper, we investigate the use of messagepassing algorithms for the problem of finding the max-weight independent set (MWIS) in a graph. First, we study the perfor...