524 search results - page 77 / 105 » Temporal reachability graphs |
110
Voted
PLDI
2004
ACM
15 years 6 months ago
2004
ACM
+ Modern network processors employ multi-threading to allow concurrency amongst multiple packet processing tasks. We studied the properties of applications running on the network p...
CSR
2010
Springer
15 years 5 months ago
2010
Springer
Algorithmic tools for graphs of small treewidth are used to address questions in complexity theory. For both arithmetic and Boolean circuits, it is shown that any circuit of size ...
124
Voted
AIPS
2004
15 years 2 months ago
2004
The planning as heuristic search framework, initiated by the planners ASP from Bonet, Loerincs and Geffner, and HSP from Bonet and Geffner, lead to some of the most performant pla...
109
click to vote
IJCAI
2003
15 years 2 months ago
2003
Relaxed plans are used in the heuristic search planner FF for computing a numerical heuristic and extracting helpful actions. We present a novel way for extracting information fro...
128
Voted
PLDI
2012
ACM
13 years 3 months ago
2012
ACM
Modularity is a central theme in any scalable program analysis. The core idea in a modular analysis is to build summaries at procedure boundaries, and use the summary of a procedu...