3049 search results - page 274 / 610 » On the Convergence of Bound Optimization Algorithms |
160
click to vote
WDAG
2007
Springer
16 years 21 days ago
2007
Springer
We study replacement algorithms for non-uniform access caches that are used in distributed storage systems. Considering access latencies as major costs of data management in such a...
171
click to vote
GECCO
2007
Springer
16 years 23 days ago
2007
Springer
In multiobjective particle swarm optimization (MOPSO) methods, selecting the local best and the global best for each particle of the population has a great impact on the convergen...
169
Voted
IPPS
2002
IEEE
15 years 11 months ago
2002
IEEE
A bulk synchronous computation proceeds in phases that are separated by barrier synchronization. For dynamic bulk synchronous computations that exhibit varying phase-wise computat...
187
Voted
SODA
2001
ACM
15 years 8 months ago
2001
ACM
Bin covering takes as input a list of items with sizes in (0 1) and places them into bins of unit demand so as to maximize the number of bins whose demand is satis ed. This is in ...
165
click to vote
SODA
2004
ACM
15 years 8 months ago
2004
ACM
We study the average-case performance of algorithms for the binary knapsack problem. Our focus lies on the analysis of so-called core algorithms, the predominant algorithmic conce...