Sciweavers

128 search results - page 19 / 26
» A Complete Bidirectional Planner
Sort
View
SEMWEB
2004
Springer
14 years 25 days ago
Information Gathering During Planning for Web Service Composition
Abstract. Hierarchical Task-Network (HTN) based planning techniques have been applied to the problem of composing Web Services, especially when described using the OWL-S service on...
Ugur Kuter, Evren Sirin, Dana S. Nau, Bijan Parsia...
WSC
2007
13 years 9 months ago
Hierarchical planning and multi-level scheduling for simulation-based probabilistic risk assessment
Simulation of dynamic complex systems—specifically, those comprised of large numbers of components with stochastic behaviors—for the purpose of probabilistic risk assessment f...
Hamed Nejad, Dongfeng Zhu, Ali Mosleh
TSMC
1998
169views more  TSMC 1998»
13 years 7 months ago
Real-time map building and navigation for autonomous robots in unknown environments
—An algorithmic solution method is presented for the problem of autonomous robot motion in completely unknown environments. Our approach is based on the alternate execution of tw...
Giuseppe Oriolo, Giovanni Ulivi, Marilena Venditte...
VTC
2010
IEEE
136views Communications» more  VTC 2010»
13 years 5 months ago
Evaluating Adjacent Channel Interference in IEEE 802.11 Networks
—The performance of 802.11-based multi-channel wireless mesh networks is affected by the interference due to neighboring nodes operating on same or adjacent channels. In this pap...
Wee Lum Tan, Konstanty Bialkowski, Marius Portmann
ICDE
2004
IEEE
155views Database» more  ICDE 2004»
14 years 8 months ago
BIDE: Efficient Mining of Frequent Closed Sequences
Previous studies have presented convincing arguments that a frequent pattern mining algorithm should not mine all frequent patterns but only the closed ones because the latter lea...
Jianyong Wang, Jiawei Han