359 search results - page 36 / 72 » Multi-state Directed Acyclic Graphs |
141
Voted
AIPS
2008
15 years 6 months ago
2008
Many current heuristics for domain-independent planning, such as Bonet and Geffner's additive heuristic and Hoffmann and Nebel's FF heuristic, are based on delete relaxa...
116
click to vote
UAI
2008
15 years 5 months ago
2008
We conjecture that the worst case number of experiments necessary and sufficient to discover a causal graph uniquely given its observational Markov equivalence class can be specif...
141
Voted
EMSOFT
2011
Springer
14 years 3 months ago
2011
Springer
Most of the hard-real-time scheduling theory for multiprocessor systems assumes independent periodic or sporadic tasks. Such a simple task model is not directly applicable to mode...
125
Voted
MST
2002
15 years 3 months ago
2002
We study the average number of delays suffered by packets routed using greedy (work conserving) scheduling policies. We obtain tight bounds on the worst-case average number of del...
158
Voted
EXACT
2009
15 years 1 months ago
2009
Across many fields involving complex computing, software systems are being augmented with workflow logging functionality. The log data can be effectively organized using declarativ...