Sciweavers

2024 search results - page 119 / 405
» A Formal Model of Multi-agent Computations
Sort
View
ECAI
2008
Springer
15 years 5 months ago
Theoretical and Computational Properties of Preference-based Argumentation
During the last years, argumentation has been gaining increasing interest in modeling different reasoning tasks of an agent. Many recent works have acknowledged the importance of ...
Yannis Dimopoulos, Pavlos Moraitis, Leila Amgoud
ICMAS
2000
15 years 5 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
121
Voted
TPDS
2008
117views more  TPDS 2008»
15 years 4 months ago
Energy-Efficient Thermal-Aware Task Scheduling for Homogeneous High-Performance Computing Data Centers: A Cyber-Physical Approac
High Performance Computing data centers have been rapidly growing, both in number and size. Thermal management of data centers can address dominant problems associated with cooling...
Qinghui Tang, Sandeep K. S. Gupta, Georgios Varsam...
AI
2004
Springer
15 years 4 months ago
On the computational complexity of qualitative coalitional games
We study coalitional games in which agents are each assumed to have a goal to be achieved, and where the characteristic property of a coalition is a set of choices, with each choi...
Michael Wooldridge, Paul E. Dunne
CORR
1998
Springer
85views Education» more  CORR 1998»
15 years 3 months ago
The Proper Treatment of Optimality in Computational Phonology
Abstract. This paper presents a novel formalization of optimality theory. Unlike previous treatments of optimality in computational linguistics, starting with Ellison 1994, the n...
Lauri Karttunen