Sciweavers

94 search results - page 13 / 19
» A note on linear function approximation using random project...
Sort
View
ACCV
2006
Springer
14 years 1 months ago
Statistical Shape Models Using Elastic-String Representations
Abstract. To develop statistical models for shapes, we utilize an elastic string representation where curves (denoting shapes) can bend and locally stretch (or compress) to optimal...
Anuj Srivastava, Aastha Jain, Shantanu H. Joshi, D...
DAGSTUHL
2004
13 years 8 months ago
On the Complexity of Parabolic Initial Value Problems with Variable Drift
We study the intrinsic difficulty of solving linear parabolic initial value problems numerically at a single point. We present a worst case analysis for deterministic as well as fo...
Knut Petras, Klaus Ritter
GECCO
2006
Springer
159views Optimization» more  GECCO 2006»
13 years 11 months ago
Standard and averaging reinforcement learning in XCS
This paper investigates reinforcement learning (RL) in XCS. First, it formally shows that XCS implements a method of generalized RL based on linear approximators, in which the usu...
Pier Luca Lanzi, Daniele Loiacono
FOCS
2007
IEEE
14 years 1 months ago
On the Hardness and Smoothed Complexity of Quasi-Concave Minimization
In this paper, we resolve the smoothed and approximative complexity of low-rank quasi-concave minimization, providing both upper and lower bounds. As an upper bound, we provide th...
Jonathan A. Kelner, Evdokia Nikolova
TASE
2008
IEEE
13 years 7 months ago
New Solution Approaches to the General Single- Machine Earliness-Tardiness Problem
This paper addresses the general single-machine earliness-tardiness problem with distinct release dates, due dates, and unit costs. The aim of this research is to obtain an exact n...
Hoksung Yau, Yunpeng Pan, Leyuan Shi