Sciweavers

719 search results - page 114 / 144
» Adaptive Online Time Allocation to Search Algorithms
Sort
View
AEI
2004
150views more  AEI 2004»
14 years 9 months ago
Ant colony optimization techniques for the vehicle routing problem
This research applies the meta-heuristic method of ant colony optimization (ACO) to an established set of vehicle routing problems (VRP). The procedure simulates the decision-maki...
John E. Bell, Patrick R. McMullen
JSAC
2006
131views more  JSAC 2006»
14 years 9 months ago
On Dynamic Optimization of Packet Matching in High-Speed Firewalls
Abstract--Packet matching plays a critical role in the performance of many network devices and a tremendous amount of research has already been invested to come up with better opti...
Hazem Hamed, Adel El-Atawy, Ehab Al-Shaer
GECCO
2006
Springer
201views Optimization» more  GECCO 2006»
15 years 1 months ago
Selective self-adaptive approach to ant system for solving unit commitment problem
This paper presents a novel approach to solve the constrained unit commitment problem using Selective Self-Adaptive Ant System (SSAS) for improving search performance by automatic...
Songsak Chusanapiputt, Dulyatat Nualhong, Sujate J...
GECCO
2008
Springer
143views Optimization» more  GECCO 2008»
14 years 10 months ago
Application domain study of evolutionary algorithms in optimization problems
This paper deals with the problem of comparing and testing evolutionary algorithms, that is, the benchmarking problem, from an analysis point of view. A practical study of the app...
Pilar Caamaño, Francisco Bellas, José...
WWW
2002
ACM
15 years 10 months ago
Improvements in practical aspects of optimally scheduling web advertising
We addressed two issues concerning the practical aspects of optimally scheduling web advertising proposed by Langheinrich et al. [5], which scheduling maximizes the total number o...
Atsuyoshi Nakamura