Sciweavers

2814 search results - page 204 / 563
» Competitive Analysis of Distributed Algorithms
Sort
View
79
Voted
GECCO
2007
Springer
132views Optimization» more  GECCO 2007»
15 years 7 months ago
Empirical analysis of ideal recombination on random decomposable problems
This paper analyzes the behavior of a selectorecombinative genetic algorithm (GA) with an ideal crossover on a class of random additively decomposable problems (rADPs). Specifical...
Kumara Sastry, Martin Pelikan, David E. Goldberg
99
Voted
CEC
2005
IEEE
15 years 6 months ago
Modeling and analysis of indirect communication in particle swarm optimization
Abstract- Particle Swarm Optimization (PSO) has successfully been applied to many optimization problems. One particularly interesting aspect of these algorithms is to study the com...
S. Helwig, Christian Haubelt, Jürgen Teich
ATAL
2005
Springer
15 years 6 months ago
Comparative analysis of top-down and bottom-up methodologies for multi-agent system design
Traditionally, top-down and bottom-up design approaches have competed with each other in Algorithmics and Software Engineering. In the top-down approach, design process starts wit...
Valentino Crespi, Aram Galstyan, Kristina Lerman
114
Voted
DEXAW
2004
IEEE
132views Database» more  DEXAW 2004»
15 years 4 months ago
Using Data-Flow Analysis for Resilience and Result Checking in Peer-To-Peer Computations
To achieve correct execution of peer-to-peer applications on non-reliable resources, we present a portable and distributed algorithm that provides fault tolerance and result checki...
Samir Jafar, Sébastien Varrette, Jean-Louis...
LCN
2005
IEEE
15 years 6 months ago
Effective Channel Time Analysis for Mobile Broadband Wireless Networks
— We describe an algorithm to estimate the future cell throughput of a multi-rate broadband wireless network based on previous measurements. The total throughput of a cell depend...
Dennis Pong, Tim Moors