Sciweavers

11910 search results - page 1982 / 2382
» Online Learning Algorithms
Sort
View
GECCO
2005
Springer
186views Optimization» more  GECCO 2005»
16 years 1 months ago
Subproblem optimization by gene correlation with singular value decomposition
Several ways of using singular value decomposition (SVD), a linear algebra technique typically used for information retrieval, to decompose problems into subproblems are investiga...
Jacob G. Martin
ICRA
2003
IEEE
165views Robotics» more  ICRA 2003»
16 years 27 days ago
Multi-robot task-allocation through vacancy chains
Existing task allocation algorithms generally do not consider the effects of task interaction, such as interference, but instead assume that tasks are independent. That assumptio...
Torbjørn S. Dahl, Maja J. Mataric, Gaurav S...
GECCO
2009
Springer
199views Optimization» more  GECCO 2009»
16 years 7 days ago
Using behavioral exploration objectives to solve deceptive problems in neuro-evolution
Encouraging exploration, typically by preserving the diversity within the population, is one of the most common method to improve the behavior of evolutionary algorithms with dece...
Jean-Baptiste Mouret, Stéphane Doncieux
CGO
2004
IEEE
15 years 11 months ago
A Dynamically Tuned Sorting Library
Empirical search is a strategy used during the installation of library generators such as ATLAS, FFTW, and SPIRAL to identify the algorithm or the version of an algorithm that del...
Xiaoming Li, María Jesús Garzar&aacu...
ACMSE
2008
ACM
15 years 9 months ago
Optimization of the multiple retailer supply chain management problem
With stock surpluses and shortages representing one of the greatest elements of risk to wholesalers, a solution to the multiretailer supply chain management problem would result i...
Caio Soares, Gerry V. Dozier, Emmett Lodree, Jared...
« Prev « First page 1982 / 2382 Last » Next »