161 search results - page 19 / 33 » Setting port numbers for fast graph exploration |
KR
2004
Springer
14 years 1 months ago
2004
Springer
One of the major advances in classical planning has been the development of Graphplan. Graphplan builds a layered structure called the planning graph, and then searches this struc...
EDBT
2006
ACM
14 years 7 months ago
2006
ACM
Navigational queries on Web-accessible life science sources pose unique query optimization challenges. The objects in these sources are interconnected to objects in other sources, ...
AIPS
2010
13 years 10 months ago
2010
Compared to optimal planners, satisficing planners can solve much harder problems but may produce overly costly and long plans. Plan quality for satisficing planners has become in...
CPM
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. In the context of non-coding RNA (ncRNA) multiple structural alignment, Davydov and Batzoglou introduced in [7] the problem of finding the largest nested linear graph tha...
CAV
2010
Springer
2010
Springer
Universal Causality Graphs: A Precise Happens-Before Model for Detecting Bugs in Concurrent Programs
13 years 9 months ago
Triggering errors in concurrent programs is a notoriously difficult task. A key reason for this is the behavioral complexity resulting from the large number of interleavings of op...