Sciweavers

418 search results - page 24 / 84
» Query Optimization by Simulated Annealing
Sort
View
GECCO
2006
Springer
143views Optimization» more  GECCO 2006»
13 years 11 months ago
Hybrid search for cardinality constrained portfolio optimization
In this paper, we describe how a genetic algorithm approach added to a simulated annealing (SA) process offers a better alternative to find the mean variance frontier in the portf...
Miguel A. Gomez, Carmen X. Flores, Maria A. Osorio
GECCO
2005
Springer
118views Optimization» more  GECCO 2005»
14 years 1 months ago
Comparative evaluation of parallelization strategies for evolutionary and stochastic heuristics
In this paper we present an evaluation of selected parallel strategies for Simulated Annealing and Simulated Evolution, identifying the impact of various issues on the effectivene...
Sadiq M. Sait, Syed Sanaullah, Ali Mustafa Zaidi, ...
ICPR
2002
IEEE
14 years 9 months ago
Radial Projections for Non-Linear Feature Extraction
In this work, two new techniques for non-linear feature extraction are presented. In these techniques, new features are obtained as radial projections of the original measurements...
Alberto J. Pérez Jiménez, Juan Carlo...
IPPS
2003
IEEE
14 years 1 months ago
A Genetic Approach to Planning in Heterogeneous Computing Environments
Planning is an artificial intelligence problem with a wide range of real-world applications. Genetic algorithms, neural networks, and simulated annealing are heuristic search met...
Han Yu, Dan C. Marinescu, Annie S. Wu, Howard Jay ...
ISPD
1998
ACM
107views Hardware» more  ISPD 1998»
14 years 5 days ago
Sequence-pair based placement method for hard/soft/pre-placed modules
This paper proposes a placement method for a mixed set of hard, soft, and pre-placed modules, based on a placement topology representation called sequence-pair. Under one sequence...
Hiroshi Murata, Ernest S. Kuh