3446 search results - page 206 / 690 » A Reasoning Algorithm for pD* |
170
click to vote
TACAS
2005
Springer
16 years 17 days ago
2005
Springer
Fair discrete systems (FDSs) are a computational model of concurrent programs where fairness assumptions are specified in terms of sets of states. The analysis of fair discrete sy...
188
click to vote
ATAL
2004
Springer
16 years 15 days ago
2004
Springer
Most BDI agent architectures rely on plan libraries in order to ensure bounded time for means-ends reasoning. Nevertheless, the usage of fast planning algorithms to provide the ag...
160
click to vote
ISCAS
2003
IEEE
16 years 11 days ago
2003
IEEE
In this paper, we introduce a tile-graph-based approach to power planning. For a given flooplan solution, the power inputs are modeled into a tile graph, the minimum capacity of e...
204
click to vote
CSL
2003
Springer
16 years 10 days ago
2003
Springer
Using the Lempel-Ziv-78 compression algorithm to compress a string yields a dictionary of substrings, i.e. an edge-labelled tree with an order-compatible enumeration, here called a...
163
Voted
ECSQARU
2003
Springer
16 years 10 days ago
2003
Springer
Abstract. The Hugin and Shenoy–Shafer architectures are two variations on the jointree algorithm, which exhibit different tradeoffs with respect to efficiency and query answeri...