Sciweavers

1662 search results - page 7 / 333
» The Computational Complexity of Agent Design Problems
Sort
View
AAAI
2010
13 years 9 months ago
Computationally Feasible Automated Mechanism Design: General Approach and Case Studies
In many multiagent settings, a decision must be made based on the preferences of multiple agents, and agents may lie about their preferences if this is to their benefit. In mechan...
Mingyu Guo, Vincent Conitzer
BMCBI
2007
109views more  BMCBI 2007»
13 years 7 months ago
Computational RNA secondary structure design: empirical complexity and improved methods
Background: We investigate the empirical complexity of the RNA secondary structure design problem, that is, the scaling of the typical difficulty of the design task for various cl...
Rosalía Aguirre-Hernández, Holger H....
GECCO
2008
Springer
160views Optimization» more  GECCO 2008»
13 years 8 months ago
Self-managing agents for dynamic scheduling in manufacturing
The main purpose of this paper is to propose a Multi-Agent Autonomic and Bio-Inspired based framework with selfmanaging capabilities to solve complex scheduling problems using coo...
Ana Madureira, Filipe Santos, Ivo Pereira
IAT
2005
IEEE
14 years 1 months ago
Coordinating Non Cooperative Planning Agents: Complexity Results
Whenever independent, non-cooperative actors jointly have to solve a complex task, they need to coordinate their efforts. Typical examples of such task coordination problems are s...
Adriaan ter Mors, Cees Witteveen
AAAI
2004
13 years 8 months ago
Towards Autonomic Computing: Adaptive Job Routing and Scheduling
Computer systems are rapidly becoming so complex that maintaining them with human support staffs will be prohibitively expensive and inefficient. In response, visionaries have beg...
Shimon Whiteson, Peter Stone