Sciweavers

310 search results - page 3 / 62
» A General Technique for Plan Repair
Sort
View
AIPS
2004
13 years 7 months ago
Guiding Planner Backjumping Using Verifier Traces
In this paper, we show how a planner can use a modelchecking verifier to guide state space search. In our work on hard real-time, closed-loop planning, we use a modelchecker'...
Robert P. Goldman, Michael J. S. Pelican, David J....
AAAI
2012
11 years 8 months ago
Lagrangian Relaxation Techniques for Scalable Spatial Conservation Planning
We address the problem of spatial conservation planning in which the goal is to maximize the expected spread of cascades of an endangered species by strategically purchasing land ...
Akshat Kumar, XiaoJian Wu, Shlomo Zilberstein
ATAL
2010
Springer
13 years 6 months ago
Merging example plans into generalized plans for non-deterministic environments
We present a new approach for finding generalized contingent plans with loops and branches in situations where there is uncertainty in state properties and object quantities, but ...
Siddharth Srivastava, Neil Immerman, Shlomo Zilber...
KBSE
2010
IEEE
13 years 4 months ago
Automated program repair through the evolution of assembly code
A method is described for automatically repairing legacy software at the assembly code level using evolutionary computation. The technique is demonstrated on Java byte code and x8...
Eric Schulte, Stephanie Forrest, Westley Weimer
ATAL
2008
Springer
13 years 7 months ago
Cost-based BDI plan selection for change propagation
Software maintenance is responsible for as much as two thirds of the cost of any software, and is consequently an important research area. In this paper we focus on the change pro...
Khanh Hoa Dam, Michael Winikoff