5214 search results - page 82 / 1043 » The Online Specialization Problem |
RANDOM
1998
Springer
13 years 12 months ago
1998
Springer
We are given a sequence of items that can be packed into m unit size bins. In the classical bin packing problem we x the size of the bins and try to pack the items in the minimum ...
NIPS
2003
13 years 9 months ago
2003
Online mechanism design (MD) considers the problem of providing incentives to implement desired system-wide outcomes in systems with self-interested agents that arrive and depart ...
GECCO
2007
Springer
14 years 1 months ago
2007
Springer
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...
TKDE
2011
13 years 2 months ago
2011
—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...
ICML
2007
IEEE
14 years 8 months ago
2007
IEEE
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 ...