Results 1  10
of
349,222
On the worstcase performance of the sumofsquares algorithm for bin packing
, 2008
"... The Sum of Squares algorithm for bin packing was defined in [2] and studied in great detail in [1], where it was proved that its worst case performance ratio is at most 3. In this note, we improve the asymptotic worst case bound to 2.7777... ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
The Sum of Squares algorithm for bin packing was defined in [2] and studied in great detail in [1], where it was proved that its worst case performance ratio is at most 3. In this note, we improve the asymptotic worst case bound to 2.7777...
On the SumofSquares Algorithm for Bin Packing
, 2000
"... In this paper we present a theoretical analysis of the deterministic online Sum of Squares algorithm (SS) for bin packing, introduced and studied experimentally in [8], along with several new variants. SS is applicable to any instance of bin packing in which the bin capacity B and item sizes s(a) ar ..."
Abstract

Cited by 126 (6 self)
 Add to MetaCart
for solving the NPhard problem of determining, given a discrete distribution F, just what is the growth rate for the optimal expected waste. An offline randomized variant SS* * performs well in a worstcase sense: For any list L of integersized items to be packed into bins of a fixed size B, the expected
Worstcase equilibria
 IN PROCEEDINGS OF THE 16TH ANNUAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE
, 1999
"... In a system in which noncooperative agents share a common resource, we propose the ratio between the worst possible Nash equilibrium and the social optimum as a measure of the effectiveness of the system. Deriving upper and lower bounds for this ratio in a model in which several agents share a ver ..."
Abstract

Cited by 851 (17 self)
 Add to MetaCart
In a system in which noncooperative agents share a common resource, we propose the ratio between the worst possible Nash equilibrium and the social optimum as a measure of the effectiveness of the system. Deriving upper and lower bounds for this ratio in a model in which several agents share a
The Robustness of the SumofSquares Algorithm for Bin Packing
, 2003
"... ... introduced the sumofsquares algorithm (SS) for online bin packing of integralsized items into integralsized bins. They showed that for discrete distributions, the expected waste of SS is sublinear if the expected waste of the oine optimal is sublinear. This algorithm SS has a time complexity ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
... introduced the sumofsquares algorithm (SS) for online bin packing of integralsized items into integralsized bins. They showed that for discrete distributions, the expected waste of SS is sublinear if the expected waste of the oine optimal is sublinear. This algorithm SS has a time complexity
Sumofsquares heuristics for binpacking . . .
, 2001
"... The sumofsquares algorithm (SS) was introduced by Csirik, Johnson, Kenyon, Shor, and Weber for online bin packing of integralsized items into integralsized bins. First, we show the results of experiments from two new variants of the SS algorithm. The first variant, which runs in time O(n √ B log ..."
Abstract
 Add to MetaCart
The sumofsquares algorithm (SS) was introduced by Csirik, Johnson, Kenyon, Shor, and Weber for online bin packing of integralsized items into integralsized bins. First, we show the results of experiments from two new variants of the SS algorithm. The first variant, which runs in time O(n √ B
Planning Algorithms
, 2004
"... This book presents a unified treatment of many different kinds of planning algorithms. The subject lies at the crossroads between robotics, control theory, artificial intelligence, algorithms, and computer graphics. The particular subjects covered include motion planning, discrete planning, planning ..."
Abstract

Cited by 1108 (51 self)
 Add to MetaCart
This book presents a unified treatment of many different kinds of planning algorithms. The subject lies at the crossroads between robotics, control theory, artificial intelligence, algorithms, and computer graphics. The particular subjects covered include motion planning, discrete planning
An Efficient Boosting Algorithm for Combining Preferences
, 1999
"... The problem of combining preferences arises in several applications, such as combining the results of different search engines. This work describes an efficient algorithm for combining multiple preferences. We first give a formal framework for the problem. We then describe and analyze a new boosting ..."
Abstract

Cited by 707 (18 self)
 Add to MetaCart
boosting algorithm for combining preferences called RankBoost. We also describe an efficient implementation of the algorithm for certain natural cases. We discuss two experiments we carried out to assess the performance of RankBoost. In the first experiment, we used the algorithm to combine different WWW
WORSTCASE PERFORMANCE BOUNDS FOR SIMPLE ONEDIMENSIONAL PACKING ALGORITHMS*
"... Abstract. The following abstract problem models several practical problems in computer science and operations research: given a list L of real numbers between 0 and 1, place the elements ofL into a minimum number L * of "bins " so that no bin contains numbers whose sum exceeds 1. M ..."
Abstract
 Add to MetaCart
Abstract. The following abstract problem models several practical problems in computer science and operations research: given a list L of real numbers between 0 and 1, place the elements ofL into a minimum number L * of "bins " so that no bin contains numbers whose sum exceeds 1
CostAware WWW Proxy Caching Algorithms
 IN PROCEEDINGS OF THE 1997 USENIX SYMPOSIUM ON INTERNET TECHNOLOGY AND SYSTEMS
, 1997
"... Web caches can not only reduce network traffic and downloading latency, but can also affect the distribution of web traffic over the network through costaware caching. This paper introduces GreedyDualSize, which incorporates locality with cost and size concerns in a simple and nonparameterized fash ..."
Abstract

Cited by 544 (6 self)
 Add to MetaCart
parameterized fashion for high performance. Tracedriven simulations show that with the appropriate cost definition, GreedyDualSize outperforms existing web cache replacement algorithms in many aspects, including hit ratios, latency reduction and network cost reduction. In addition, GreedyDualSize can potentially
Graphbased algorithms for Boolean function manipulation
 IEEE TRANSACTIONS ON COMPUTERS
, 1986
"... In this paper we present a new data structure for representing Boolean functions and an associated set of manipulation algorithms. Functions are represented by directed, acyclic graphs in a manner similar to the representations introduced by Lee [1] and Akers [2], but with further restrictions on th ..."
Abstract

Cited by 3499 (47 self)
 Add to MetaCart
on the ordering of decision variables in the graph. Although a function requires, in the worst case, a graph of size exponential in the number of arguments, many of the functions encountered in typical applications have a more reasonable representation. Our algorithms have time complexity proportional
Results 1  10
of
349,222