Sciweavers

5316 search results - page 124 / 1064
» Which Search Problems Are Random
Sort
View
GECCO
2007
Springer
164views Optimization» more  GECCO 2007»
15 years 9 months ago
A study of mutational robustness as the product of evolutionary computation
This paper investigates the ability of a tournament selection based genetic algorithm to find mutationally robust solutions to a simple combinatorial optimization problem. Two di...
Justin Schonfeld
CIKM
2009
Springer
15 years 10 months ago
A social recommendation framework based on multi-scale continuous conditional random fields
This paper addresses the issue of social recommendation based on collaborative filtering (CF) algorithms. Social recommendation emphasizes utilizing various attributes informatio...
Xin Xin, Irwin King, Hongbo Deng, Michael R. Lyu
126
Voted
ECCV
2006
Springer
16 years 5 months ago
Learning to Combine Bottom-Up and Top-Down Segmentation
Bottom-up segmentation based only on low-level cues is a notoriously difficult problem. This difficulty has lead to recent top-down segmentation algorithms that are based on class-...
Anat Levin, Yair Weiss
111
Voted
CEC
2010
IEEE
15 years 4 months ago
Evolving programs with parameters and loops
At the current state of the art, genetic programs do not contain two constructs that commonly occur in programs written by humans, that is, loops and functions with parameters. In ...
Gayan Wijesinghe, Victor Ciesielski
145
Voted
ICML
2007
IEEE
16 years 4 months ago
Reinforcement learning by reward-weighted regression for operational space control
Many robot control problems of practical importance, including operational space control, can be reformulated as immediate reward reinforcement learning problems. However, few of ...
Jan Peters, Stefan Schaal