Sciweavers

2566 search results - page 60 / 514
» The Online Median Problem
Sort
View
GECCO
2007
Springer
137views Optimization» more  GECCO 2007»
14 years 4 months ago
Learning and anticipation in online dynamic optimization with evolutionary algorithms: the stochastic case
The focus of this paper is on how to design evolutionary algorithms (EAs) for solving stochastic dynamic optimization problems online, i.e. as time goes by. For a proper design, t...
Peter A. N. Bosman, Han La Poutré
TKDE
2011
363views more  TKDE 2011»
13 years 5 months ago
Efficient Techniques for Online Record Linkage
—The need to consolidate the information contained in heterogeneous data sources has been widely documented in recent years. In order to accomplish this goal, an organization mus...
Debabrata Dey, Vijay S. Mookerjee, Dengpan Liu
ICML
2007
IEEE
14 years 11 months ago
Online discovery of similarity mappings
We consider the problem of choosing, sequentially, a map which assigns elements of a set A to a few elements of a set B. On each round, the algorithm suffers some cost associated ...
Alexander Rakhlin, Jacob Abernethy, Peter L. Bartl...
CPAIOR
2006
Springer
14 years 2 months ago
Online Stochastic Reservation Systems
This paper considers online stochastic reservation problems, where requests come online and must be dynamically allocated to limited resources in order to maximize profit. Multi-k...
Pascal Van Hentenryck, Russell Bent, Yannis Vergad...
IPL
2010
93views more  IPL 2010»
13 years 9 months ago
Randomized algorithms for online bounded bidding
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...
Leah Epstein, Asaf Levin