Sciweavers

27 search results - page 3 / 6
» Proofs, pictures, and Euclid
Sort
View
AIPS
2004
13 years 10 months ago
Complexity of Planning with Partial Observability
We show that for conditional planning with partial observability the existence problem of plans with success probability 1 is 2-EXP-complete. This result completes the complexity ...
Jussi Rintanen
JMIV
2006
58views more  JMIV 2006»
13 years 8 months ago
On the Probability of the Number of Solutions for the P4P Problem
This paper studies the multi-solution phenomenon for the perspective four point (P4P) problem from geometric and algebraic aspects. We give a pure geometric proof that the P4P pro...
Xiao-Shan Gao, Jianliang Tang
STOC
2012
ACM
225views Algorithms» more  STOC 2012»
11 years 11 months ago
An algorithmic characterization of multi-dimensional mechanisms
We obtain a characterization of feasible, Bayesian, multi-item multi-bidder mechanisms with independent, additive bidders as distributions over hierarchical mechanisms. Combined w...
Yang Cai, Constantinos Daskalakis, S. Matthew Wein...
BIRTHDAY
2010
Springer
13 years 9 months ago
Thirteen Definitions of a Stable Model
Stable models of logic programs have been studied by many researchers, mainly because of their role in the foundations of answer set programming. This is a review of some of the de...
Vladimir Lifschitz
AMAI
1998
Springer
13 years 8 months ago
Generalization and Specialization Strategies for Learning r.e. Languages
Overgeneralization is a major issue in the identification of grammars for formal languages from positive data. Different formulations of generalization and specialization strate...
Sanjay Jain, Arun Sharma