Sciweavers

451 search results - page 40 / 91
» Simulated Annealing for Convex Optimization
Sort
View
IDA
2008
Springer
15 years 3 months ago
A comprehensive analysis of hyper-heuristics
Meta-heuristics such as simulated annealing, genetic algorithms and tabu search have been successfully applied to many difficult optimization problems for which no satisfactory pro...
Ender Özcan, Burak Bilgin, Emin Erkan Korkmaz
151
Voted
KES
2006
Springer
15 years 3 months ago
Scheduling Jobs on Computational Grids Using Fuzzy Particle Swarm Algorithm
Abstract. Grid computing is a computing framework to meet the growing computational demands. This paper introduces a novel approach based on Particle Swarm Optimization (PSO) for s...
Ajith Abraham, Hongbo Liu, Weishi Zhang, Tae-Gyu C...
AMC
2005
136views more  AMC 2005»
15 years 3 months ago
Solving a dynamic cell formation problem using metaheuristics
In this paper, solving a cell formation (CF) problem in dynamic condition is going to be discussed by using some traditional metaheuristic methods such as genetic algorithm (GA), ...
Reza Tavakkoli-Moghaddam, M. B. Aryanezhad, Nima S...
144
Voted
ECCV
2006
Springer
16 years 5 months ago
Statistical Priors for Efficient Combinatorial Optimization Via Graph Cuts
Abstract. Bayesian inference provides a powerful framework to optimally integrate statistically learned prior knowledge into numerous computer vision algorithms. While the Bayesian...
Daniel Cremers, Leo Grady
135
Voted
TCOM
2010
92views more  TCOM 2010»
15 years 2 months ago
Detection of Gaussian constellations in MIMO systems under imperfect CSI
Abstract—This paper considers the problem of Gaussian symbols detection in MIMO systems in the presence of channel estimation errors. Under this framework we develop a computatio...
Ido Nevat, Gareth W. Peters, Jinhong Yuan