Sciweavers

602 search results - page 103 / 121
» Automatic Optimization for MapReduce Programs
Sort
View
CP
2004
Springer
13 years 11 months ago
ID Walk: A Candidate List Strategy with a Simple Diversification Device
This paper presents a new optimization metaheuristic called ID Walk (Intensification/Diversification Walk) that offers advantages for combining simplicity with effectiveness. In ad...
Bertrand Neveu, Gilles Trombettoni, Fred Glover
AI
1998
Springer
13 years 7 months ago
Model-Based Average Reward Reinforcement Learning
Reinforcement Learning (RL) is the study of programs that improve their performance by receiving rewards and punishments from the environment. Most RL methods optimize the discoun...
Prasad Tadepalli, DoKyeong Ok
GECCO
1999
Springer
111views Optimization» more  GECCO 1999»
13 years 11 months ago
Evolving a behavior-based control architecture- From simulations to the real world
Genetic programming makes it possible to automatically search the space of possible programs. First we evolved a behavior-based control architecture using computer simulations. Th...
Marc Ebner, Andreas Zell
ICCV
2003
IEEE
14 years 9 months ago
Images as Bags of Pixels
We propose modeling images and related visual objects as bags of pixels or sets of vectors. For instance, gray scale images are modeled as a collection or bag of (X, Y, I) pixel v...
Tony Jebara
INFOCOM
2009
IEEE
14 years 2 months ago
Minimizing Probing Cost for Detecting Interface Failures: Algorithms and Scalability Analysis
— The automatic detection of failures in IP paths is an essential step for operators to perform diagnosis or for overlays to adapt. We study a scenario where a set of monitors se...
Hung Xuan Nguyen, Renata Teixeira, Patrick Thiran,...