Sciweavers

43 search results - page 4 / 9
» A Framework for Automatic Problem Decomposition in Planning
Sort
View
ICDCSW
2009
IEEE
13 years 5 months ago
Automated Service Composition in Next-Generation Networks
Dynamic composition of protocol features allows applications to establish connections with custom communication characteristics. Automatically computing possible compositions and ...
Shashank Shanbhag, Xin Huang, Santosh Proddatoori,...
ICDT
2009
ACM
166views Database» more  ICDT 2009»
14 years 8 months ago
A compositional framework for complex queries over uncertain data
The ability to flexibly compose confidence computation with the operations of relational algebra is an important feature of probabilistic database query languages. Computing confi...
Christoph Koch, Michaela Götz
ICML
1996
IEEE
14 years 8 months ago
Representing and Learning Quality-Improving Search Control Knowledge
Generating good, production-quality plans is an essential element in transforming planners from research tools into real-world applications, but one that has been frequently overl...
M. Alicia Pérez
AAAI
2012
11 years 10 months ago
POMDPs Make Better Hackers: Accounting for Uncertainty in Penetration Testing
Penetration Testing is a methodology for assessing network security, by generating and executing possible hacking attacks. Doing so automatically allows for regular and systematic...
Carlos Sarraute, Olivier Buffet, Jörg Hoffman...
IJRR
2002
92views more  IJRR 2002»
13 years 7 months ago
On Fitted Stratified and Semi-Stratified Geometric Manipulation Planning with Fingertip Relocations
This paper presents two object manipulation planning methods based on fitted stratified and semi-stratified approaches using finger relocations. The problem is discussed in the fr...
István Harmati, Béla Lantos, Shahram...