Sciweavers

1146 search results - page 42 / 230
» On the Complexity of Domain-Independent Planning
Sort
View
AIPS
2008
13 years 10 months ago
From One to Many: Planning for Loosely Coupled Multi-Agent Systems
Loosely coupled multi-agent systems are perceived as easier to plan for because they require less coordination between agent sub-plans. In this paper we set out to formalize this ...
Ronen I. Brafman, Carmel Domshlak
AIPS
2009
13 years 9 months ago
Learning User Plan Preferences Obfuscated by Feasibility Constraints
It has long been recognized that users can have complex preferences on plans. Non-intrusive learning of such preferences by observing the plans executed by the user is an attracti...
Nan Li, William Cushing, Subbarao Kambhampati, Sun...
JSW
2008
73views more  JSW 2008»
13 years 7 months ago
Teaching Virtual Experts for Multi-Domain Collaborative Planning
Abstract-- This paper presents an approach to rapid development of virtual planning experts that can collaborate to develop plans of action requiring expertise from multiple domain...
Gheorghe Tecuci, Mihai Boicu, Dorin Marcu, Marcel ...
ESWA
2011
243views Database» more  ESWA 2011»
12 years 11 months ago
A novel case based reasoning approach to radiotherapy planning
Radiotherapy planning is a complex problem which requires both expertise and experience of an oncologist. A Case Based Reasoning (CBR) system is developed to generate dose plans f...
Sanja Petrovic, Nishikant Mishra, Santhanam Sundar
WDAG
2007
Springer
97views Algorithms» more  WDAG 2007»
14 years 1 months ago
On the Message Complexity of Indulgent Consensus
Many recommend planning for the worst and hoping for the best. In this paper we devise efficient indulgent consensus algorithms that can tolerate crash failures and arbitrarily lo...
Seth Gilbert, Rachid Guerraoui, Dariusz R. Kowalsk...