Sciweavers

437 search results - page 21 / 88
» Adaptivity and computational complexity in the numerical sol...
Sort
View
GECCO
2006
Springer
181views Optimization» more  GECCO 2006»
13 years 11 months ago
Particle swarm with speciation and adaptation in a dynamic environment
This paper describes an extension to a speciation-based particle swarm optimizer (SPSO) to improve performance in dynamic environments. The improved SPSO has adopted several prove...
Xiaodong Li, Jürgen Branke, Tim Blackwell
IJCAI
2001
13 years 9 months ago
Adaptive Control of Acyclic Progressive Processing Task Structures
The progressive processing model allows a system to trade off resource consumption against the quality of the outcome by mapping each activity to a graph of potential solution met...
Stéphane Cardon, Abdel-Illah Mouaddib, Shlo...
ATAL
2006
Springer
13 years 11 months ago
The communication complexity of coalition formation among autonomous agents
It is self-evident that in numerous Multiagent settings, selfish agents stand to benefit from cooperating by forming coalitions. Nevertheless, negotiating a stable distribution of...
Ariel D. Procaccia, Jeffrey S. Rosenschein
CMG
2008
13 years 9 months ago
Computing Missing Service Demand Parameters for Performance Models
One of the challenges in building analytic performance models such as queuing network models is obtaining service demands for the various workloads and various devices. While some...
Daniel A. Menascé
GECCO
2006
Springer
207views Optimization» more  GECCO 2006»
13 years 11 months ago
Both robust computation and mutation operation in dynamic evolutionary algorithm are based on orthogonal design
A robust dynamic evolutionary algorithm (labeled RODEA), where both the robust calculation and mutation operator are based on an orthogonal design, is proposed in this paper. Prev...
Sanyou Y. Zeng, Rui Wang, Hui Shi, Guang Chen, Hug...