Sciweavers

2192 search results - page 26 / 439
» Algorithms for Challenging Motif Problems
Sort
View
CEC
2008
IEEE
14 years 2 months ago
Solving deceptive problems using a genetic algorithm with reserve selection
— Deceptive problems are a class of challenging problems for conventional genetic algorithms (GAs), which usually mislead the search to some local optima rather than the global o...
Yang Chen, Jinglu Hu, Kotaro Hirasawa, Songnian Yu
FSTTCS
2006
Springer
13 years 11 months ago
Approximation Algorithms for 2-Stage Stochastic Optimization Problems
Abstract. Stochastic optimization is a leading approach to model optimization problems in which there is uncertainty in the input data, whether from measurement noise or an inabili...
Chaitanya Swamy, David B. Shmoys
SETN
2010
Springer
13 years 12 months ago
Genetic Algorithm Solution to Optimal Sizing Problem of Small Autonomous Hybrid Power Systems
The optimal sizing of a small autonomous hybrid power system can be a very challenging task, due to the large number of design settings and the uncertainty in key parameters. This ...
Yiannis A. Katsigiannis, Pavlos S. Georgilakis, Em...
CEC
2009
IEEE
13 years 11 months ago
A simple multi-objective optimization algorithm for the urban transit routing problem
— The urban transit routing problem (UTRP) for public transport systems involves finding a set of efficient transit routes to meet customer demands. The UTRP is an NPHard, high...
Lang Fan, Christine L. Mumford, Dafydd Evans
GEM
2008
13 years 9 months ago
Evaluating a Parallel Evolutionary Algorithm on the Chess Endgame Problem
Classifying the endgame positions in Chess can be challenging for humans and is known to be a difficult task in machine learning. An evolutionary algorithm would seem to be the ide...
Wayne Iba, Kelsey Marshman, Benjamin Fisk