188 search results - page 6 / 38 » What Is a Skeptical Proof |
159
click to vote
CORR
2002
Springer
15 years 5 months ago
2002
Springer
Preference elicitation is a central problem in AI, and has received significant attention in single-agent settings. It is also a key problem in multiagent systems, but has receive...
144
click to vote
WDAG
2009
Springer
16 years 10 days ago
2009
Springer
Abstract. Optimistic and nonblocking concurrent algorithms are increasingly finding their way into practical use; an important example is software transactional memory implementat...
147
click to vote
RSA
2010
15 years 15 days ago
2010
We show that asymptotic equivalence, in a strong form, holds between two random graph models with slightly differing edge probabilities under substantially weaker conditions than w...
170
click to vote
RSA
2008
15 years 5 months ago
2008
For a graph property P, the edit distance of a graph G from P, denoted EP (G), is the minimum number of edge modifications (additions or deletions) one needs to apply to G in orde...
154
click to vote
AI
1998
Springer
15 years 5 months ago
1998
Springer
In this paper, we propose a definition of goal achievability: given a basic action theory describing an initial state of the world and some primitive actions available to a robot...