Sciweavers

945 search results - page 164 / 189
» Dialog Convergence and Learning
Sort
View
COR
2008
122views more  COR 2008»
13 years 10 months ago
First steps to the runtime complexity analysis of ant colony optimization
: The paper presents results on the runtime complexity of two ant colony optimization (ACO) algorithms: Ant System, the oldest ACO variant, and GBAS, the first ACO variant for whic...
Walter J. Gutjahr
JMLR
2006
124views more  JMLR 2006»
13 years 9 months ago
Policy Gradient in Continuous Time
Policy search is a method for approximately solving an optimal control problem by performing a parametric optimization search in a given class of parameterized policies. In order ...
Rémi Munos
RAS
2007
138views more  RAS 2007»
13 years 9 months ago
Image-based robot navigation from an image memory
This paper addresses the problem of vision-based navigation and proposes an original control law to perform such navigation. The overall approach is based on an appearance-based r...
Anthony Remazeilles, François Chaumette
IOR
2010
128views more  IOR 2010»
13 years 7 months ago
Dynamic Assortment Optimization with a Multinomial Logit Choice Model and Capacity Constraint
The paper considers a stylized model of a dynamic assortment optimization problem, where given a limited capacity constraint, we must decide the assortment of products to offer to...
Paat Rusmevichientong, Zuo-Jun Max Shen, David B. ...
CVPR
2009
IEEE
15 years 5 months ago
Layered Graph Matching by Composite Cluster Sampling with Collaborative and Competitive Interactions
This paper studies a framework for matching an unknown number of corresponding structures in two images (shapes), motivated by detecting objects in cluttered background and lear...
Kun Zeng, Liang Lin, Song Chun Zhu, Xiaobai Liu