1206 search results - page 50 / 242 » Convergence analysis of online algorithms |
INFOCOM
2003
IEEE
15 years 3 months ago
2003
IEEE
— Recent investigations into the pricing of multiclass loss networks have shown that static prices are optimal in the asymptotic regime of many small sources. These results sugge...
104
click to vote
GECCO
2006
Springer
15 years 1 months ago
2006
Springer
This paper describes our study into the concept of using rewards in a classifier system applied to the acquisition of decision-making algorithms for agents in a soccer game. Our a...
ICASSP
2011
IEEE
14 years 1 months ago
2011
IEEE
In this work, the tracking analysis of the Normalized Least Mean Fourth (NLMF) algorithm is investigated for a random walk channel under very weak assumptions. The novelty of this...
83
Voted
IPL
2008
14 years 9 months ago
2008
In this paper, we prove polynomial running time bounds for an Ant Colony Optimization (ACO) algorithm for the single-destination shortest path problem on directed acyclic graphs. ...
106
click to vote
SAGA
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. Motivated by an application in project portfolio analysis under uncertainty, we develop an algorithm S-VNS for solving stochastic combinatorial optimization (SCO) problem...