893 search results - page 6 / 179 » P3C: A New Algorithm for the Simple Temporal Problem |
135
Voted
AIPS
2007
15 years 5 months ago
2007
We present three new complexity results for classes of planning problems with simple causal graphs. First, we describe a polynomial time algorithm that uses macros to generate pla...
118
click to vote
JAIR
2008
15 years 3 months ago
2008
We present three new complexity results for classes of planning problems with simple causal graphs. First, we describe a polynomial-time algorithm that uses macros to generate pla...
139
click to vote
ICML
2009
IEEE
16 years 3 months ago
2009
IEEE
Previous studies of Non-Parametric Kernel (NPK) learning usually reduce to solving some Semi-Definite Programming (SDP) problem by a standard SDP solver. However, time complexity ...
116
click to vote
CPAIOR
2006
Springer
15 years 6 months ago
2006
Springer
Temporal planning (TP) is notoriously difficult because it requires to solve a propositional STRIPS planning problem with temporal constraints. In this paper, we propose an efficie...
114
click to vote
AAAI
2004
15 years 4 months ago
2004
The resource-constrained project scheduling problem with time windows (RCPSP/max) is an important generalization of a number of well studied scheduling problems. In this paper, we...