Sciweavers

179 search results - page 4 / 36
» Optimizing Computation of Recovery Plans for BPEL Applicatio...
Sort
View
AI
2008
Springer
14 years 10 months ago
Sequential Monte Carlo in reachability heuristics for probabilistic planning
The current best conformant probabilistic planners encode the problem as a bounded length CSP or SAT problem. While these approaches can find optimal solutions for given plan leng...
Daniel Bryce, Subbarao Kambhampati, David E. Smith
ICDCS
2002
IEEE
15 years 2 months ago
Query Optimization to Meet Performance Targets for Wide Area Applications
Recent technology advances have enabled mediated query processing with Internet accessible WebSources. A characteristic of WebSources is that their access costs exhibit transient ...
Vladimir Zadorozhny, Louiqa Raschid
AIPS
2006
14 years 11 months ago
Sequential Monte Carlo in Probabilistic Planning Reachability Heuristics
The current best conformant probabilistic planners encode the problem as a bounded length CSP or SAT problem. While these approaches can find optimal solutions for given plan leng...
Daniel Bryce, Subbarao Kambhampati, David E. Smith
AIIA
2009
Springer
15 years 2 months ago
Optimal Planning with ACO
In this paper a planning framework based on Ant Colony Optimization techniques is presented. Optimal planning is a very hard computational problem which has been coped with differe...
Marco Baioletti, Alfredo Milani, Valentina Poggion...
GECCO
2005
Springer
126views Optimization» more  GECCO 2005»
15 years 3 months ago
Evolutionary computation methods for synchronization of effects based operations
Effects based operations (EBO) is a concept based on the premise that a desired strategic outcome can be achieved through synergistic, multiplicative, and cumulative application ...
Jeffrey P. Ridder