Sciweavers

700 search results - page 113 / 140
» Combinations of Stit and Actions
Sort
View
AAAI
2006
13 years 9 months ago
Compiling Uncertainty Away: Solving Conformant Planning Problems using a Classical Planner (Sometimes)
Even under polynomial restrictions on plan length, conformant planning remains a very hard computational problem as plan verification itself can take exponential time. This heavy ...
Héctor Palacios, Hector Geffner
AAAI
2006
13 years 9 months ago
Contingent Planning with Goal Preferences
The importance of the problems of contingent planning with actions that have non-deterministic effects and of planning with goal preferences has been widely recognized, and severa...
Dmitry Shaparau, Marco Pistore, Paolo Traverso
APCCM
2006
13 years 9 months ago
Process modelling: the deontic way
Current enterprise systems rely heavily on the modelling and enactment of business processes. One of the key criteria for a business process is to represent not just the behaviour...
Vineet Padmanabhan, Guido Governatori, Shazia Wasi...
FLAIRS
2004
13 years 9 months ago
A Local Search/Constraint Propagation Hybrid for a Network Routing Problem
This paper presents a hybrid algorithm that combines local search and constraint programming techniques to solve a network routing problem. The problem considered is that of routi...
Jonathan Lever
IJCAI
2003
13 years 9 months ago
Simultaneous Adversarial Multi-Robot Learning
Multi-robot learning faces all of the challenges of robot learning with all of the challenges of multiagent learning. There has been a great deal of recent research on multiagent ...
Michael H. Bowling, Manuela M. Veloso