Sciweavers

6562 search results - page 100 / 1313
» Noetherianity and Combination Problems
Sort
View
111
Voted
GECCO
2000
Springer
150views Optimization» more  GECCO 2000»
15 years 4 months ago
A Hybrid Genetic Algorithm for the Quadratic Assignment Problem
A heuristic technique that combines a genetic algorithm with a Tabu Search algorithm is applied to the Quadratic Assignment Problem (QAP). The hybrid algorithm improves the result...
Manuel Vázquez, L. Darrell Whitley
GECCO
2009
Springer
144views Optimization» more  GECCO 2009»
15 years 7 months ago
A hybrid genetic algorithm for a variant of two-dimensional packing problem
A variant of two-dimensional packing problem was given in the GECCO’2008 competition. This paper describes the genetic algorithm that produced the best result and thus won the N...
Jin Kim, Byung Ro Moon
105
Voted
ISSAC
1995
Springer
108views Mathematics» more  ISSAC 1995»
15 years 4 months ago
A Solution to the Extended GCD Problem
An improved method for expressing the greatest common divisor of n numbers as an integer linear combination of the numbers is presented and analyzed, both theoretically and practi...
Bohdan S. Majewski, George Havas
ICML
2000
IEEE
16 years 1 months ago
Bayesian Averaging of Classifiers and the Overfitting Problem
Although Bayesian model averaging is theoretically the optimal method for combining learned models, it has seen very little use in machine learning. In this paper we study its app...
Pedro Domingos
113
Voted
ICIC
2007
Springer
15 years 7 months ago
An Improved Nested Partitions Algorithm Based on Simulated Annealing in Complex Decision Problem Optimization
: - This paper introduces the main ideas of the nested partitions (NP) method, analyses its efficiency theoretically and proposes the way to improve the optimization efficiency of ...
Yan Luo, Changrui Yu