107 search results - page 18 / 22 » Planning and Patching Proof |
JAIR
2011
2011
Analyzing Search Topology Without Running Any Search: On the Connection Between Causal Graphs and h+
14 years 12 days ago
The ignoring delete lists relaxation is of paramount importance for both satisficing and optimal planning. In earlier work, it was observed that the optimal relaxation heuristic ...
145
click to vote
SIGMOD
2009
ACM
15 years 9 months ago
2009
ACM
HoTMaN (HoT-standby MaNager) is a joint research and development project between MySpace and USC Database Laboratory to design and develop a tool to ensure a 24x7 up-time and ease...
71
Voted
ICSE
2004
IEEE-ACM
15 years 9 months ago
2004
IEEE-ACM
Semantic Web, the next generation of Web, gives data well-defined and machine-understandable meaning so that they can be processed by remote intelligent agents cooperatively. Onto...
CP
2007
Springer
15 years 3 months ago
2007
Springer
It has recently been shown, for the Constraint Satisfaction Problem (CSP), that the state associated with a node of the search tree built by a backtracking algorithm can be exploit...
74
Voted
GC
2004
Springer
15 years 2 months ago
2004
Springer
Abstract. We present the computational counterpart of the KGP (Knowledge, Goals, Plan) declarative model of agency for Global Computing. In this context, a computational entity is ...