Results 1  10
of
1,727,716
An optimal online algorithm for metrical task systems
 Journal of the ACM
, 1992
"... Abstract. In practice, almost all dynamic systems require decisions to be made online, without full knowledge of their future impact on the system. A general model for the processing of sequences of tasks is introduced, and a general online decnion algorithm is developed. It is shown that, for an ..."
Abstract

Cited by 213 (8 self)
 Add to MetaCart
, for an important algorithms. class of special cases, this algorithm is optimal among all online Specifically, a task system (S. d) for processing sequences of tasks consists of a set S of states and a cost matrix d where d(i, j) is the cost of changing from state i to state j (we assume that d satisfies
The Optimal Online Algorithms for Minimizing Maximum Lateness
, 2003
"... It is well known that the EarliestDeadlineFirst (EDF) and the LeastLaxityFirst (LLF) algorithms are optimal algorithms for the problem of preemptively scheduling jobs that arrive over time on a single machine to minimize maximum lateness. It was not previously known what other online algorithms ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
It is well known that the EarliestDeadlineFirst (EDF) and the LeastLaxityFirst (LLF) algorithms are optimal algorithms for the problem of preemptively scheduling jobs that arrive over time on a single machine to minimize maximum lateness. It was not previously known what other online algorithms
Optimal Online Algorithms for Minimax Resource Scheduling
"... We consider a very general online scheduling problem with an objective to minimize the maximum level of resource allocated. We find a simple characterization of an optimal deterministic online algorithm. We develop further results for two more specific problems, single resource scheduling and hierar ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
We consider a very general online scheduling problem with an objective to minimize the maximum level of resource allocated. We find a simple characterization of an optimal deterministic online algorithm. We develop further results for two more specific problems, single resource scheduling
Optimal Online Algorithms for Multidimensional Packing Problems
 SIAM J. COMPUTING
, 2005
"... We solve an open problem in the literature by providing an online algorithm for multidimensional bin packing that uses only bounded space. To achieve this, we introduce a new technique for classifying the items to be packed. We show that our algorithm is optimal among bounded space algorithms for an ..."
Abstract

Cited by 8 (1 self)
 Add to MetaCart
We solve an open problem in the literature by providing an online algorithm for multidimensional bin packing that uses only bounded space. To achieve this, we introduce a new technique for classifying the items to be packed. We show that our algorithm is optimal among bounded space algorithms
EnergyOptimal Online Algorithms for Broadcasting in Wireless Networks
"... The paper considers the design of energyefficient online protocols for the basic problem of message transmission to hosts positioned at unknown distances in adhoc wireless networks. The paper formulates a number of variants of this problem and presents optimally competitive algorithms for those va ..."
Abstract
 Add to MetaCart
The paper considers the design of energyefficient online protocols for the basic problem of message transmission to hosts positioned at unknown distances in adhoc wireless networks. The paper formulates a number of variants of this problem and presents optimally competitive algorithms for those
Optimal Online Algorithms on Two Hierarchical Machines with Resource Augmentation
"... Abstract. This paper investigates an online hierarchical scheduling problem with resource augmentation, i.e., the resources of the online algorithms are different from those of the offline algorithms. The machines are provided with different capacity according to their hierarchies. One with the hier ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
with the hierarchy 1 has a speed of s (q) in the online (offline) algorithms and can process all the jobs. The other with hierarchy 2 has a speed of 1 in the online/offline algorithms and can only process partial jobs. The objective is to minimize makespan. For any 0 <q,s<∞, wepresent optimal online algorithms
Near Optimal Online Algorithms and Fast Approximation Algorithms for Resource Allocation Problems
, 2011
"... We present algorithms for a class of resource allocation problems both in the online setting with stochastic input and in the offline setting. This class of problems contains many interesting special cases such as the Adwords problem. In the online setting we introduce a new distributional model cal ..."
Abstract

Cited by 31 (3 self)
 Add to MetaCart
We present algorithms for a class of resource allocation problems both in the online setting with stochastic input and in the offline setting. This class of problems contains many interesting special cases such as the Adwords problem. In the online setting we introduce a new distributional model
Optimal Aggregation Algorithms for Middleware
 IN PODS
, 2001
"... Assume that each object in a database has m grades, or scores, one for each of m attributes. For example, an object can have a color grade, that tells how red it is, and a shape grade, that tells how round it is. For each attribute, there is a sorted list, which lists each object and its grade under ..."
Abstract

Cited by 701 (4 self)
 Add to MetaCart
must access every object in the database, to find its grade under each attribute. Fagin has given an algorithm (“Fagin’s Algorithm”, or FA) that is much more efficient. For some monotone aggregation functions, FA is optimal with high probability in the worst case. We analyze an elegant and remarkably
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
A data locality optimizing algorithm
, 1991
"... 1 Introduction As processor speed continues to increase faster than memory speed, optimizations to use the memory hierarchy efficiently become ever more important. Blocking [9] ortiling [18] is a wellknown technique that improves the data locality of numerical algorithms [1, 6, 7, 12, 13].Tiling c ..."
Abstract

Cited by 805 (16 self)
 Add to MetaCart
1 Introduction As processor speed continues to increase faster than memory speed, optimizations to use the memory hierarchy efficiently become ever more important. Blocking [9] ortiling [18] is a wellknown technique that improves the data locality of numerical algorithms [1, 6, 7, 12, 13].Tiling
Results 1  10
of
1,727,716