Sciweavers

626 search results - page 22 / 126
» Satisfying Maintenance Goals
Sort
View
ICMAS
2000
13 years 10 months ago
The Computational Complexity of Agent Design Problems
This paper investigates the computational complexity of a fundamental problem in multi-agent systems: given an environment together with a specification of some task, can we const...
Michael Wooldridge
LOGCOM
1998
178views more  LOGCOM 1998»
13 years 8 months ago
Applying the Mu-Calculus in Planning and Reasoning about Action
Planning algorithms have traditionally been geared toward achievement goals in single-agent environments. Such algorithms essentially produce plans to reach one of a specified se...
Munindar P. Singh
ATAL
2006
Springer
14 years 22 days ago
Temporal qualitative coalitional games
Qualitative Coalitional Games (QCGs) are a version of coalitional games in which an agent's desires are represented as goals which are either satisfied or unsatisfied, and ea...
Thomas Ågotnes, Wiebe van der Hoek, Michael ...
AAAI
1997
13 years 10 months ago
Abductive Completion of Plan Sketches
Most work on AI planning has focused on the development of fully automated methods for generating plans that satisfy user-speci ed goals. However, users in many domains want the a...
Karen L. Myers
TON
2012
11 years 11 months ago
Power Control for Cognitive Radio Networks: Axioms, Algorithms, and Analysis
—The deployment of cognitive radio networks enables efficient spectrum sharing and opportunistic spectrum access. It also presents new challenges to the classical problem of int...
Siamak Sorooshyari, Chee Wei Tan, Mung Chiang