Sciweavers

2180 search results - page 208 / 436
» Comparing bio-inspired algorithms in constrained optimizatio...
Sort
View
GECCO
2009
Springer
143views Optimization» more  GECCO 2009»
15 years 10 months ago
Exploiting hierarchical clustering for finding bounded diameter minimum spanning trees on euclidean instances
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising, for example, in network design when quality of service is of concern. ...
Martin Gruber, Günther R. Raidl
143
Voted
EC
2008
164views ECommerce» more  EC 2008»
15 years 3 months ago
Tracking Moving Optima Using Kalman-Based Predictions
The dynamic optimization problem concerns finding an optimum in a changing environment. In the field of evolutionary algorithms, this implies dealing with a timechanging fitness l...
Claudio Rossi, Mohamed Abderrahim, Julio Cé...
122
Voted
RSA
2008
80views more  RSA 2008»
15 years 2 months ago
The persistent-access-caching algorithm
ABSTRACT: Caching is widely recognized as an effective mechanism for improving the performance of the World Wide Web. One of the key components in engineering the Web caching syste...
Predrag R. Jelenkovic, Ana Radovanovic
104
Voted
DATE
2005
IEEE
172views Hardware» more  DATE 2005»
15 years 9 months ago
Evolutionary Optimization in Code-Based Test Compression
We provide a general formulation for the code-based test compression problem with fixed-length input blocks and propose a solution approach based on Evolutionary Algorithms. In c...
Ilia Polian, Alejandro Czutro, Bernd Becker
91
Voted
CVPR
2007
IEEE
16 years 5 months ago
Illumination Multiplexing within Fundamental Limits
Taking a sequence of photographs using multiple illumination sources or settings is central to many computer vision and graphics problems. A growing number of recent methods use m...
Netanel Ratner, Yoav Y. Schechner