Sciweavers

416 search results - page 43 / 84
» Approximation Algorithms for Reliable Stochastic Combinatori...
Sort
View
MMSP
2008
IEEE
216views Multimedia» more  MMSP 2008»
14 years 3 months ago
Using stochastic gradient-descent scheme in appearance model based face tracking
— Active appearance model (AAM) has been widely used in face tracking and recognition. However, accuracy and efficiency are always two main challenges with the AAM search. The pa...
Zhidong Li, Jing Chen, Adrian Chong, Zhenghua Yu, ...
GECCO
2007
Springer
150views Optimization» more  GECCO 2007»
14 years 2 months ago
Credit assignment in adaptive memetic algorithms
Adaptive Memetic Algorithms couple an evolutionary algorithm with a number of local search heuristics for improving the evolving solutions. They are part of a broad family of meta...
J. E. Smith
GECCO
2007
Springer
164views Optimization» more  GECCO 2007»
14 years 2 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
ICML
2010
IEEE
13 years 9 months ago
Toward Off-Policy Learning Control with Function Approximation
We present the first temporal-difference learning algorithm for off-policy control with unrestricted linear function approximation whose per-time-step complexity is linear in the ...
Hamid Reza Maei, Csaba Szepesvári, Shalabh ...
SIGECOM
2009
ACM
137views ECommerce» more  SIGECOM 2009»
14 years 3 months ago
An exact almost optimal algorithm for target set selection in social networks
The Target Set Selection problem proposed by Kempe, Kleinberg, and Tardos, gives a nice clean combinatorial formulation for many problems arising in economy, sociology, and medicin...
Oren Ben-Zwi, Danny Hermelin, Daniel Lokshtanov, I...