3367 search results - page 201 / 674 » Incremental assignment problem |
154
click to vote
GECCO
2010
Springer
15 years 8 months ago
2010
Springer
Adaptive Operator Selection (AOS) turns the impacts of the applications of variation operators into Operator Selection through a Credit Assignment mechanism. However, most Credit ...
155
Voted
FOCS
2008
IEEE
15 years 4 months ago
2008
IEEE
In the mobile facility location problem, which is a variant of the classical Uncapacitated Facility Location and kMedian problems, each facility and client is assigned to a start ...
147
Voted
CORR
2006
Springer
15 years 3 months ago
2006
Springer
Suppose we are given a set of objects that cover a region and a duration associated with each object. Viewing the objects as jobs, can we schedule their beginning times to maximiz...
112
click to vote
TON
2002
15 years 3 months ago
2002
Abstract-Dynamic routing protocols such as RIP and OSPF essentially implement distributed algorithms for solving the Shortest Paths Problem. The Border Gateway Protocol (BGP) is cu...
212
Voted
SODA
2012
ACM
13 years 6 months ago
2012
ACM
We give a constant factor approximation algorithm for the following generalization of the k-median problem. We are given a set of clients and facilities in a metric space. Each fa...