3446 search results - page 324 / 690 » A Reasoning Algorithm for pD* |
198
click to vote
JSAC
2008
15 years 6 months ago
2008
In this paper, we study the theoretical problem of the end-to-end rate assignment for multi-hop wireless networks. Specifically, we consider the problem of joint congestion control...
274
click to vote
GIS
2006
ACM
16 years 7 months ago
2006
ACM
Situational awareness (SA) applications monitor the real world and the entities therein to support tasks such as rapid decision-making, reasoning, and analysis. Raw input about un...
169
click to vote
DAC
2005
ACM
16 years 7 months ago
2005
ACM
SAT (Boolean satisfiability) has become the primary Boolean reasoning engine for many EDA applications, so the efficiency of SAT solving is of great practical importance. Recently...
159
click to vote
CADE
2008
Springer
16 years 7 months ago
2008
Springer
Tree automata completion is a technique for the verification of infinite state systems. It has already been used for the verification of cryptographic protocols and the prototyping...
226
click to vote
CADE
2007
Springer
16 years 7 months ago
2007
Springer
Manna and Pnueli have extensively shown how a mixture of first-order logic (FOL) and discrete Linear time Temporal Logic (LTL) is sufficient to precisely state verification problem...