Sciweavers

457 search results - page 41 / 92
» A Dialectic Approach to Problem-Solving
Sort
View
GECCO
2007
Springer
326views Optimization» more  GECCO 2007»
14 years 3 months ago
Binary differential evolution for the unit commitment problem
The Unit Commitment Problem (UCP) is the task of finding an optimal turn on and turn off schedule for a group of power generation units over a given time horizon to minimize ope...
Ali Keles
ATAL
2005
Springer
14 years 2 months ago
Multiagent planning through plan repair
We present a novel approach to multiagent planning for self-interested agents. The main idea behind our approach is that multiagent planning systems should be built upon (single-a...
Roman van der Krogt, Nico Roos, Mathijs de Weerdt,...
GECCO
2005
Springer
143views Optimization» more  GECCO 2005»
14 years 2 months ago
Solving geometric TSP with ants
This paper presents an ant-based approach for solving the Traveling Salesman Problem (TSP). Novel concepts of this algorithm that distinguish it from the other heuristics are the ...
Thang Nguyen Bui, Mufit Colpan
ATAL
2005
Springer
14 years 2 months ago
On possibilistic case-based reasoning for selecting partners for multi-attribute agent negotiation
We propose an enhanced mechanism for selecting partners for multi-attribute negotiation. The mechanism employs possibilistic case-based reasoning. The possibility of successful ne...
Jakub Brzostowski, Ryszard Kowalczyk
MMAS
2004
Springer
14 years 2 months ago
Towards Fault-Tolerant Massively Multiagent Systems
Abstract. In order to construct and deploy massively multiagent systems, we must address one of the fundamental issues of distributed systems, the possibility of partial failures. ...
Zahia Guessoum, Jean-Pierre Briot, Nora Faci