162 search results - page 27 / 33 » Completeness Guarantees for Incomplete Reasoners |
ECRTS
1999
IEEE
15 years 2 months ago
1999
IEEE
Many industrial applications mandate the use of a timetriggered paradigm and consequently the use of off-line scheduling for reasons such as predictability, certification, cost, o...
100
click to vote
ACMICEC
2006
ACM
15 years 1 months ago
2006
ACM
Consider an open infrastructure in which anyone can deploy mechanisms to support automated decision making and coordination amongst self-interested computational agents. Strategyp...
ASIACRYPT
2009
Springer
15 years 1 months ago
2009
Springer
Abstract. Public-key encryption schemes rely for their IND-CPA security on per-message fresh randomness. In practice, randomness may be of poor quality for a variety of reasons, le...
109
click to vote
AAAI
2007
15 years 4 days ago
2007
Efficient query answering over ontologies is one of the most useful and important services to support Semantic Web applications. Approximation has been identified as a potential...
AAAI
2004
14 years 11 months ago
2004
We study a form of the pursuit-evasion problem, in which one or more searchers must move through a given environment so as to guarantee detection of any and all evaders, which can...