Sciweavers

223 search results - page 31 / 45
» Approximate local search in combinatorial optimization
Sort
View
POPL
2002
ACM
14 years 7 months ago
An efficient profile-analysis framework for data-layout optimizations
Data-layout optimizations rearrange fields within objects, objects within objects, and objects within the heap, with the goal of increasing spatial locality. While the importance ...
Rastislav Bodík, Shai Rubin, Trishul M. Chi...
ISM
2008
IEEE
119views Multimedia» more  ISM 2008»
14 years 1 months ago
Using Exact Locality Sensitive Mapping to Group and Detect Audio-Based Cover Songs
Cover song detection is becoming a very hot research topic when plentiful personal music recordings or performance are released on the Internet. A nice cover song recognizer helps...
Yi Yu, J. Stephen Downie, Fabian Mörchen, Lei...
GECCO
2006
Springer
122views Optimization» more  GECCO 2006»
13 years 11 months ago
Genetic algorithms are suitable for driving microbial ecosystems in desirable directions
The behavior of natural, biological ecosystems is for a large part determined by environmental conditions. It should therefore be possible to experimentally manipulate such condit...
Frederik P. J. Vandecasteele, Thomas F. Hess, Rona...
AI
2001
Springer
14 years 1 days ago
Imitation and Reinforcement Learning in Agents with Heterogeneous Actions
Reinforcement learning techniques are increasingly being used to solve di cult problems in control and combinatorial optimization with promising results. Implicit imitation can acc...
Bob Price, Craig Boutilier
CP
2006
Springer
13 years 11 months ago
Performance Prediction and Automated Tuning of Randomized and Parametric Algorithms
Abstract. Machine learning can be utilized to build models that predict the runtime of search algorithms for hard combinatorial problems. Such empirical hardness models have previo...
Frank Hutter, Youssef Hamadi, Holger H. Hoos, Kevi...