Sciweavers

297 search results - page 19 / 60
» J-MADeM, a market-based model for complex decision problems
Sort
View
WDAG
2001
Springer
131views Algorithms» more  WDAG 2001»
13 years 12 months ago
The Complexity of Synchronous Iterative Do-All with Crashes
Abstract. The ability to cooperate on common tasks in a distributed setting is key to solving a broad range of computation problems ranging from distributed search such as SETI to ...
Chryssis Georgiou, Alexander Russell, Alexander A....
PAMI
2008
155views more  PAMI 2008»
13 years 7 months ago
Subclass Problem-Dependent Design for Error-Correcting Output Codes
A common way to model multiclass classification problems is by means of Error-Correcting Output Codes (ECOCs). Given a multiclass problem, the ECOC technique designs a code word fo...
Sergio Escalera, David M. J. Tax, Oriol Pujol, Pet...
AI
2006
Springer
13 years 7 months ago
On the computational complexity of coalitional resource games
We study Coalitional Resource Games (CRGs), a variation of Qualitative Coalitional Games (QCGs) in which each agent is endowed with a set of resources, and the ability of a coalit...
Michael Wooldridge, Paul E. Dunne
CSCLP
2008
Springer
13 years 9 months ago
An Efficient Decision Procedure for Functional Decomposable Theories Based on Dual Constraints
Abstract. Over the last decade, first-order constraints have been efficiently used in the artificial intelligence world to model many kinds of complex problems such as: scheduling,...
Khalil Djelloul
ECAI
2004
Springer
14 years 28 days ago
Emergence of Complex Networks through Local Optimization
Abstract. The emergence of complex network structures of relationships between autonomous agents occurs in a wide range of distributed systems. Many researchers have proposed model...
Josep M. Pujol, Andreas Flache, Ramon Sangües...