Sciweavers

3096 search results - page 148 / 620
» Theory and Use of the EM Algorithm
Sort
View
MOBIHOC
2007
ACM
16 years 4 months ago
Approximation algorithms for longest-lived directional multicast communications in WANETs
Several centralized and distributed algorithms have been recently proposed to maximize the multicast lifetime for directional communications in wireless ad-hoc networks. Their per...
Song Guo, Oliver W. W. Yang, Victor C. M. Leung
GECCO
2008
Springer
152views Optimization» more  GECCO 2008»
15 years 6 months ago
Designing EDAs by using the elitist convergent EDA concept and the boltzmann distribution
This paper presents a theoretical definition for designing EDAs called Elitist Convergent Estimation of Distribution Algorithm (ECEDA), and a practical implementation: the Boltzm...
Sergio Ivvan Valdez Peña, Arturo Hern&aacut...
GCC
2003
Springer
15 years 10 months ago
A Load Balancing Algorithm for Web Based Server Grids
Load balance is a critical issue in distributed systems, such as server grids. In this paper, we propose a Balanced Load Queue (BLQ) model, which combines the queuing theory and hy...
Shui Yu, John Casey, Wanlei Zhou
137
Voted
GECCO
2005
Springer
126views Optimization» more  GECCO 2005»
15 years 10 months ago
Not all linear functions are equally difficult for the compact genetic algorithm
Estimation of distribution algorithms (EDAs) try to solve an optimization problem by finding a probability distribution focussed around its optima. For this purpose they conduct ...
Stefan Droste
153
Voted
VISUALIZATION
2003
IEEE
15 years 10 months ago
Counting Cases in Marching Cubes: Toward a Generic Algorithm for Producing Substitopes
We describe how to count the cases that arise in a family of visualization techniques, including Marching Cubes, Sweeping Simplices, Contour Meshing, Interval Volumes, and Separat...
David C. Banks, Stephen A. Linton