Sciweavers

500 search results - page 27 / 100
» A Sample Approximation Approach for Optimization with Probab...
Sort
View
EDBT
2006
ACM
121views Database» more  EDBT 2006»
14 years 8 months ago
A Decomposition-Based Probabilistic Framework for Estimating the Selectivity of XML Twig Queries
In this paper we present a novel approach for estimating the selectivity of XML twig queries. Such a technique is useful for approximate query answering as well as for determining...
Chao Wang, Srinivasan Parthasarathy, Ruoming Jin
AIPS
2009
13 years 9 months ago
Navigation Planning in Probabilistic Roadmaps with Uncertainty
Probabilistic Roadmaps (PRM) are a commonly used class of algorithms for robot navigation tasks where obstacles are present in the environment. We examine the situation where the ...
Michael Kneebone, Richard Dearden
IJCAI
1997
13 years 9 months ago
Mini-Buckets: A General Scheme for Generating Approximations in Automated Reasoning
The class of algorithms for approximating reasoning tasks presented in this paper is based on approximating the general bucket elimination framework. The algorithms have adjustabl...
Rina Dechter
IROS
2007
IEEE
131views Robotics» more  IROS 2007»
14 years 2 months ago
A hybrid approach for complete motion planning
Abstract— We present an efficient algorithm for complete motion planning that combines approximate cell decomposition (ACD) with probabilistic roadmaps (PRM). Our approach uses ...
Liangjun Zhang, Young J. Kim, Dinesh Manocha
CDC
2009
IEEE
168views Control Systems» more  CDC 2009»
14 years 20 days ago
Content distribution by multiple multicast trees and intersession cooperation: Optimal algorithms and approximations
—The paper addresses the problem of massive content distribution in the network where multiple sessions coexist. In the traditional approaches, the sessions form separate overlay...
Xiaoying Zheng, Chunglae Cho, Ye Xia