Results 1 
6 of
6
Scheduling for LargeScale OnDemand Data Broadcasting
 IEEE INFOCOM
, 1998
"... Abstract — Recent advances in telecommunications have enabled the deployment of broadcastbased widearea information services that provide ondemand data access to very large client populations. In order to effectively utilize a broadcast medium for such a service, it is necessary to have efficient ..."
Abstract

Cited by 67 (4 self)
 Add to MetaCart
Abstract — Recent advances in telecommunications have enabled the deployment of broadcastbased widearea information services that provide ondemand data access to very large client populations. In order to effectively utilize a broadcast medium for such a service, it is necessary to have efficient, online scheduling algorithms that can balance individual and overall performance, and can scale in terms of data set sizes, client populations, and broadcast bandwidth. In this study we introduce a parameterized algorithm that provides good performance across all of these criteria and can be tuned to emphasize either average or worst case waiting time. Unlike previous work on low overhead scheduling, the algorithm is not based on estimates of the access probabilities of items, but rather, it makes scheduling decisions based on the current queue state, allowing it to easily adapt to changes in the intensity and distribution of the workload. We examine the performance of the algorithm using a simulation model.
The LEDA class real number
 MaxPlanck Institut Inform
, 1996
"... We describe the implementation of the LEDA [MN95, Nah95] data type real. Every integer is a real and reals are closed under the operations addition, subtraction, multiplication, division and squareroot. The main features of the data type real are ffl The userinterface is similar to that of the bu ..."
Abstract

Cited by 16 (5 self)
 Add to MetaCart
We describe the implementation of the LEDA [MN95, Nah95] data type real. Every integer is a real and reals are closed under the operations addition, subtraction, multiplication, division and squareroot. The main features of the data type real are ffl The userinterface is similar to that of the builtin data type double.
Global Search Methods For Solving Nonlinear Optimization Problems
, 1997
"... ... these new methods, we develop a prototype, called Novel (Nonlinear Optimization Via External Lead), that solves nonlinear constrained and unconstrained problems in a unified framework. We show experimental results in applying Novel to solve nonlinear optimization problems, including (a) the lear ..."
Abstract

Cited by 15 (1 self)
 Add to MetaCart
... these new methods, we develop a prototype, called Novel (Nonlinear Optimization Via External Lead), that solves nonlinear constrained and unconstrained problems in a unified framework. We show experimental results in applying Novel to solve nonlinear optimization problems, including (a) the learning of feedforward neural networks, (b) the design of quadraturemirrorfilter digital filter banks, (c) the satisfiability problem, (d) the maximum satisfiability problem, and (e) the design of multiplierless quadraturemirrorfilter digital filter banks. Our method achieves better solutions than existing methods, or achieves solutions of the same quality but at a lower cost.
Hopf Algebras in General and in Combinatorial Physics: a practical introduction
, 802
"... Abstract. This tutorial is intended to give an accessible introduction to Hopf algebras. The mathematical context is that of representation theory, and we also illustrate the structures with examples taken from combinatorics and quantum physics, showing that in this latter case the axioms of Hopf al ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Abstract. This tutorial is intended to give an accessible introduction to Hopf algebras. The mathematical context is that of representation theory, and we also illustrate the structures with examples taken from combinatorics and quantum physics, showing that in this latter case the axioms of Hopf algebra arise naturally. The text contains many exercises, some taken from physics, aimed at expanding and exemplifying the concepts introduced. 1.
Parallel Processing (ICA3PP96) Preemptive Job Scheduling in Star Graph Networks
"... In this paper we develop a feasibility algorithm for preemptively scheduling a given set of jobs with dimension and time requirements on a star graph network of given size with a given deadline. We show that the algorithm runs in O(n log n) time where n is the number of jobs. 1 ..."
Abstract
 Add to MetaCart
In this paper we develop a feasibility algorithm for preemptively scheduling a given set of jobs with dimension and time requirements on a star graph network of given size with a given deadline. We show that the algorithm runs in O(n log n) time where n is the number of jobs. 1
Super Rotator: . . . Network Graph of Sublogarithmic Diameter
, 1996
"... We propose a new family of directed interconnection network graphs for an arbitrary number of nodes. The proposed network graph is almost regular (the difference between the indegrees and out degrees of nodes is 2, a constant independent of the size of the network), has a diameter sub logarithmic i ..."
Abstract
 Add to MetaCart
We propose a new family of directed interconnection network graphs for an arbitrary number of nodes. The proposed network graph is almost regular (the difference between the indegrees and out degrees of nodes is 2, a constant independent of the size of the network), has a diameter sub logarithmic in the number of nodes, is optimally fault tolerant and can be defined for an arbitrary number of nodes.