Sciweavers

101 search results - page 16 / 21
» Convergence of Gradient Dynamics with a Variable Learning Ra...
Sort
View
COLT
2005
Springer
14 years 7 days ago
General Polynomial Time Decomposition Algorithms
We present a general decomposition algorithm that is uniformly applicable to every (suitably normalized) instance of Convex Quadratic Optimization and efficiently approaches an o...
Nikolas List, Hans-Ulrich Simon
CORR
2011
Springer
209views Education» more  CORR 2011»
12 years 10 months ago
Close the Gaps: A Learning-while-Doing Algorithm for a Class of Single-Product Revenue Management Problems
In this work, we consider a retailer selling a single product with limited on-hand inventory over a finite selling season. Customer demand arrives according to a Poisson process,...
Zizhuo Wang, Shiming Deng, Yinyu Ye
CCIA
2009
Springer
13 years 7 months ago
Text Detection in Urban Scenes
Abstract. Text detection in urban scenes is a hard task due to the high variability of text appearance: different text fonts, changes in the point of view, or partial occlusion are...
Sergio Escalera, Xavier Baró, Jordi Vitri&a...
ESAW
2008
Springer
13 years 8 months ago
Contribution to the Control of a MAS's Global Behaviour: Reinforcement Learning Tools
Reactive multi-agent systems present global behaviours uneasily linked to their local dynamics. When it comes to controlling such a system, usual analytical tools are difficult to ...
François Klein, Christine Bourjot, Vincent ...
COCOA
2007
Springer
14 years 26 days ago
A Lagrangian Relaxation Approach for the Multiple Sequence Alignment Problem
Abstract. We present a branch-and-bound (bb) algorithm for the multiple sequence alignment problem (MSA), one of the most important problems in computational biology. The upper bou...
Ernst Althaus, Stefan Canzar