700 search results - page 113 / 140 » Combinations of Stit and Actions |
AAAI
2006
14 years 11 months ago
2006
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 ...
72
Voted
AAAI
2006
14 years 11 months ago
2006
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...
APCCM
2006
14 years 11 months ago
2006
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...
FLAIRS
2004
14 years 11 months ago
2004
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...
IJCAI
2003
14 years 11 months ago
2003
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 ...