11910 search results - page 180 / 2382 » Online Learning Algorithms |
145
click to vote
ICALP
1991
Springer
15 years 4 months ago
1991
Springer
We give an on-line deterministic algorithm for the weighted bipartite matching problem that achieves a competitive ratio of (2n − 1) in any metric space (where n is the number o...
IPL
2010
14 years 11 months ago
2010
In the online bidding problem, a bidder is trying to guess a positive number T, by placing bids until the value of the bid is at least T. The bidder is charged with the sum of the...
COLT
1999
Springer
15 years 5 months ago
1999
Springer
This paper proposes the use of constructive ordinals as mistake bounds in the on-line learning model. This approach elegantly generalizes the applicability of the on-line mistake ...
104
click to vote
PPSN
1998
Springer
15 years 5 months ago
1998
Springer
In this paper we present AntNet, a novel adaptive approach to routing tables learning in packet-switched communications networks. AntNet is inspired by the stigmergy model of commu...
118
Voted
ASC
2006
15 years 2 months ago
2006
This paper presents a new algorithm for enhancing the efficiency of simulation-based optimisation using local search and neural network metamodels. The local search strategy is ba...