Sciweavers

914 search results - page 57 / 183
» The Computational Complexity of Probabilistic Planning
Sort
View
IROS
2009
IEEE
163views Robotics» more  IROS 2009»
14 years 5 months ago
On the performance of random linear projections for sampling-based motion planning
— Sampling-based motion planners are often used to solve very high-dimensional planning problems. Many recent algorithms use projections of the state space to estimate properties...
Ioan Alexandru Sucan, Lydia E. Kavraki
ECAI
2008
Springer
14 years 15 days ago
Towards Efficient Belief Update for Planning-Based Web Service Composition
At the "functional level", Semantic Web Services (SWS) are described akin to planning operators, with preconditions and effects relative to an ontology; the ontology prov...
Jörg Hoffmann
DASFAA
2009
IEEE
133views Database» more  DASFAA 2009»
14 years 5 months ago
Probabilistic Ranking in Uncertain Vector Spaces
Abstract. In many application domains, e.g. sensor databases, traffic management or recognition systems, objects have to be compared based on positionally and existentially uncert...
Thomas Bernecker, Hans-Peter Kriegel, Matthias Ren...
ICPP
2008
IEEE
14 years 5 months ago
Parallelization and Characterization of Probabilistic Latent Semantic Analysis
Probabilistic Latent Semantic Analysis (PLSA) is one of the most popular statistical techniques for the analysis of two-model and co-occurrence data. It has applications in inform...
Chuntao Hong, Wenguang Chen, Weimin Zheng, Jiulong...
ICLP
1997
Springer
14 years 2 months ago
Hybrid Probabilistic Programs
Hybrid Probabilistic Programs (HPPs) are logic programs that allow the programmer to explicitly encode his knowledge of the dependencies between events being described in the prog...
Alex Dekhtyar, V. S. Subrahmanian