Sciweavers

359 search results - page 41 / 72
» A Hybrid Genetic Algorithm for the Quadratic Assignment Prob...
Sort
View
GECCO
2003
Springer
141views Optimization» more  GECCO 2003»
14 years 1 months ago
Finding the Optimal Gene Order in Displaying Microarray Data
The rapid advances of genome-scale sequencing have brought out the necessity of developing new data processing techniques for enormous genomic data. Microarrays, for example, can g...
Seung-Kyu Lee, Yong-Hyuk Kim, Byung Ro Moon
JMLR
2006
89views more  JMLR 2006»
13 years 8 months ago
Maximum-Gain Working Set Selection for SVMs
Support vector machines are trained by solving constrained quadratic optimization problems. This is usually done with an iterative decomposition algorithm operating on a small wor...
Tobias Glasmachers, Christian Igel
GPEM
2008
128views more  GPEM 2008»
13 years 8 months ago
Coevolutionary bid-based genetic programming for problem decomposition in classification
In this work a cooperative, bid-based, model for problem decomposition is proposed with application to discrete action domains such as classification. This represents a significan...
Peter Lichodzijewski, Malcolm I. Heywood
ICRA
2007
IEEE
124views Robotics» more  ICRA 2007»
14 years 3 months ago
Sensor-Based Dynamic Assignment in Distributed Motion Planning
— Distributed motion planning of multiple agents raises fundamental and novel problems in control theory and robotics. Recently, one such great challenge has been the development...
Michael M. Zavlanos, George J. Pappas
TROB
2008
164views more  TROB 2008»
13 years 8 months ago
Dynamic Assignment in Distributed Motion Planning With Local Coordination
Distributed motion planning of multiple agents raises fundamental and novel problems in control theory and robotics. In particular, in applications such as coverage by mobile senso...
Michael M. Zavlanos, George J. Pappas