93 search results - page 13 / 19 » Online Primal-Dual Algorithms for Covering and Packing Probl... |
148
click to vote
EC
2008
15 years 1 months ago
2008
We consider an optimization problem of finding the best possible offspring as a result of a recombination operator in an evolutionary algorithm, given two parent solutions. The op...
121
click to vote
COLT
2006
Springer
15 years 5 months ago
2006
Springer
In an online convex optimization problem a decision-maker makes a sequence of decisions, i.e., chooses a sequence of points in Euclidean space, from a fixed feasible set. After ea...
126
click to vote
FOCS
2008
IEEE
15 years 3 months ago
2008
IEEE
Given a universe U of n elements and a weighted collection S of m subsets of U, the universal set cover problem is to a-priori map each element u ∈ U to a set S(u) ∈ S contain...
118
click to vote
STOC
2007
ACM
16 years 2 months ago
2007
ACM
In an online linear optimization problem, on each period t, an online algorithm chooses st S from a fixed (possibly infinite) set S of feasible decisions. Nature (who may be adve...
154
Voted
INFOCOM
2011
IEEE
14 years 5 months ago
2011
IEEE
—Recent advances in virtualization technology have made it a common practice to consolidate virtual machines(VMs) into a fewer number of servers. An efficient consolidation sche...