Sciweavers

4908 search results - page 347 / 982
» On the Complexity of Optimal K-Anonymity
Sort
View
GECCO
2005
Springer
160views Optimization» more  GECCO 2005»
16 years 9 days ago
Designing resilient networks using a hybrid genetic algorithm approach
As high-speed networks have proliferated across the globe, their topologies have become sparser due to the increased capacity of communication media and cost considerations. Relia...
Abdullah Konak, Alice E. Smith
INFOCOM
2003
IEEE
16 years 2 days ago
Network Design For Rate Adaptive Media Streams
— Rate adaptive multimedia streams offer significant system and client benefits over non-adaptive streams. These benefits come at the price of increased complexity in providin...
Steven Weber, Gustavo de Veciana
GECCO
2010
Springer
157views Optimization» more  GECCO 2010»
15 years 11 months ago
Configuration of a genetic algorithm for multi-objective optimisation of solar gain to buildings
We report the formulation and implementation of a genetic algorithm to address multi-objective optimisation of solar gain to buildings with the goal of minimising energy consumpti...
Ralph Evins
FGR
2004
IEEE
141views Biometrics» more  FGR 2004»
15 years 10 months ago
Smart Particle Filtering for 3D Hand Tracking
Solving the tracking of an articulated structure in a reasonable time is a complex task mainly due to the high dimensionality of the problem. A new optimization method, called Sto...
Matthieu Bray, Esther Koller-Meier, Luc J. Van Goo...
GECCO
2006
Springer
181views Optimization» more  GECCO 2006»
15 years 10 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