1647 search results - page 63 / 330 » Improved Randomized Approximation Algorithms for Lot-Sizing ... |
149
click to vote
TAMC
2009
Springer
15 years 11 months ago
2009
Springer
We investigate a natural combinatorial optimization problem called the Label Cut problem. Given an input graph G with a source s and a sink t, the edges of G are classified into ...
132
Voted
FOCS
2007
IEEE
15 years 11 months ago
2007
IEEE
In the weighted paging problem there is a weight (cost) for fetching each page into the cache. We design a randomized O(log k)-competitive online algorithm for the weighted paging...
143
Voted
CD
2005
Springer
15 years 10 months ago
2005
Springer
In distributed and mobile environments, the connections among the hosts on which a software system is running are often unstable. As a result of connectivity losses, the overall a...
131
click to vote
EMO
2009
Springer
15 years 11 months ago
2009
Springer
We propose an elitist Greedy Randomized Adaptive Search Procedure (GRASP) metaheuristic algorithm, called mGRASP/MH, for approximating the Pareto-optimal front in the multi-objecti...
135
click to vote
ICML
2004
IEEE
16 years 5 months ago
2004
IEEE
This paper extends previous work on the Skewing algorithm, a promising approach that allows greedy decision tree induction algorithms to handle problematic functions such as parit...