Sciweavers

1034 search results - page 73 / 207
» Competitive generalized auctions
Sort
View
120
Voted
EOR
2006
118views more  EOR 2006»
15 years 16 days ago
A random-key genetic algorithm for the generalized traveling salesman problem
The Generalized Traveling Salesman Problem is a variation of the well known Traveling Salesman Problem in which the set of nodes is divided into clusters; the objective is to find...
Lawrence V. Snyder, Mark S. Daskin
PPSN
2010
Springer
14 years 11 months ago
A Hybrid Genetic Algorithm for the Traveling Salesman Problem Using Generalized Partition Crossover
We present a hybrid Genetic Algorithm that incorporates the Generalized Partition Crossover (GPX) operator to produce an algorithm that is competitive with the state of the art for...
Darrell Whitley, Doug Hains, Adele E. Howe
212
Voted
ICDE
2008
IEEE
141views Database» more  ICDE 2008»
16 years 1 months ago
A General Framework for Fast Co-clustering on Large Datasets Using Matrix Decomposition
Abstract-- Simultaneously clustering columns and rows (coclustering) of large data matrix is an important problem with wide applications, such as document mining, microarray analys...
Feng Pan, Xiang Zhang, Wei Wang 0010
88
Voted
ICASSP
2009
IEEE
15 years 7 months ago
Generalized mutual interdependence analysis
The mean of a data set is one trivial representation of data from one class. Recently, mutual interdependence analysis (MIA) has been successfully used to extract more involved re...
Heiko Claussen, Justinian Rosca, Robert I. Damper
80
Voted
GECCO
2004
Springer
15 years 6 months ago
Designing Multiplicative General Parameter Filters Using Adaptive Genetic Algorithms
Multiplicative general parameter (MGP) approach to finite impulse response (FIR) filtering introduces a novel way to realize cost effective adaptive filters in compact very large s...
Jarno Martikainen, Seppo J. Ovaska