Sciweavers

213 search results - page 32 / 43
» A comparison of search heuristics for empirical code optimiz...
Sort
View
LWA
2004
14 years 11 months ago
Modeling Rule Precision
This paper reports first results of an empirical study of the precision of classification rules on an independent test set. We generated a large number of rules using a general co...
Johannes Fürnkranz
GECCO
2011
Springer
248views Optimization» more  GECCO 2011»
14 years 1 months ago
Size-based tournaments for node selection
In genetic programming, the reproductive operators of crossover and mutation both require the selection of nodes from the reproducing individuals. Both unbiased random selection a...
Thomas Helmuth, Lee Spector, Brian Martin
ESWA
2007
100views more  ESWA 2007»
14 years 9 months ago
Using memetic algorithms with guided local search to solve assembly sequence planning
The goal of assembly planning consists in generating feasible sequences to assemble a product and selecting an efficient assembly sequence from which related constraint factors su...
Hwai-En Tseng, Wen-Pai Wang, Hsun-Yi Shih
JAIR
2008
107views more  JAIR 2008»
14 years 9 months ago
Planning with Durative Actions in Stochastic Domains
Probabilistic planning problems are typically modeled as a Markov Decision Process (MDP). MDPs, while an otherwise expressive model, allow only for sequential, non-durative action...
Mausam, Daniel S. Weld
GECCO
2005
Springer
139views Optimization» more  GECCO 2005»
15 years 3 months ago
A genetic algorithm for unmanned aerial vehicle routing
Genetic Algorithms (GAs) can efficiently produce high quality results for hard combinatorial real world problems such as the Vehicle Routing Problem (VRP). Genetic Vehicle Represe...
Matthew A. Russell, Gary B. Lamont