Sciweavers

1027 search results - page 44 / 206
» Comparing Search Algorithms for the Temperature Inversion Pr...
Sort
View
ALGORITHMICA
1998
73views more  ALGORITHMICA 1998»
13 years 7 months ago
Linear Probing and Graphs
Mallows and Riordan showed in 1968 that labeled trees with a small number of inversions are related to labeled graphs that are connected and sparse. Wright enumerated sparse connec...
Donald E. Knuth
AIPS
2010
13 years 10 months ago
Action Elimination and Plan Neighborhood Graph Search: Two Algorithms for Plan Improvement
Compared to optimal planners, satisficing planners can solve much harder problems but may produce overly costly and long plans. Plan quality for satisficing planners has become in...
Hootan Nakhost, Martin Müller 0003
BIOADIT
2004
Springer
14 years 1 months ago
Searching for a Practical Evidence of the No Free Lunch Theorems
Abstract. According to the No Free Lunch (NFL) theorems all blackbox algorithms perform equally well when compared over the entire set of optimization problems. An important proble...
Mihai Oltean
HIS
2009
13 years 5 months ago
Improved Harmony Search for Economic Power Dispatch
This paper presents a novel optimization approach using Improved Harmony Search (IHS) algorithm to solve economic power dispatch problem. The proposed methodology easily takes care...
V. Ravikumar Pandi, Bijaya K. Panigrahi, Manas Kum...
GECCO
2010
Springer
207views Optimization» more  GECCO 2010»
14 years 20 days ago
Generalized crowding for genetic algorithms
Crowding is a technique used in genetic algorithms to preserve diversity in the population and to prevent premature convergence to local optima. It consists of pairing each offsp...
Severino F. Galán, Ole J. Mengshoel