Results 1  10
of
92
Spanners with slack
 PROCEEDINGS OF THE 14TH EUROPEAN SYMPOSIUM ON ALGORITHMS
, 2006
"... Given a metric (V,d), a spanner is a sparse graph whose shortestpath metric approximates the distance d to within a small multiplicative distortion. In this paper, we study the problem of spanners with slack: e.g., can we find sparse spanners where we are allowed to incur an arbitrarily large dist ..."
Abstract

Cited by 9 (2 self)
 Add to MetaCart
distortion on a small constant fraction of the distances, but are then required to incur only a constant (independent of n) distortion on the remaining distances? We answer this question in the affirmative, thus complementing similar recent results on embeddings with slack into ℓp spaces. For instance, we
Compact Routing with Slack
, 2007
"... Given a weighted graph G = (V, E), a compact routing scheme is a distributed algorithm for forwarding packets from any source to any destination. The fundamental tradeoff is between the space used at each node and the stretch of the total route, measured by the multiplicative factor between the act ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
the actual distance traveled and the length of the shortest possible route. We extend the normal definition with a slack parameter ffl, which allows us to ignore up to ffln2 of the shortest pairwise routes and give a guarantee on the remaining ones. For constant ffl we give constant stretch, polylogarithmic
Compact Routing with Slack in Low Doubling Dimension ABSTRACT
"... We consider the problem of compact routing with slack in networks of low doubling dimension. Namely, we seek nameindependent routing schemes with (1 + ɛ) stretch and polylogarithmic storage at each node: since existing lower bound precludes such a scheme, we relax our guarantees to allow for (i) a s ..."
Abstract

Cited by 9 (1 self)
 Add to MetaCart
We consider the problem of compact routing with slack in networks of low doubling dimension. Namely, we seek nameindependent routing schemes with (1 + ɛ) stretch and polylogarithmic storage at each node: since existing lower bound precludes such a scheme, we relax our guarantees to allow for (i) a
Slack free MEA and RDM with comprehensive efficiency measures
"... a b s t r a c t This paper extends two directional distance function models, the Multidirectional Efficiency Analysis (MEA) Model and the Range Directional Model (RDM), in order to account for any type of technical inefficiency, i.e. both directional and nondirectional inefficiencies. We first fo ..."
Abstract
 Add to MetaCart
invariant and covers both models. Secondly, we introduce the RDM model under constant returns to scale (CRS) together with a new comprehensive efficiency measure.
Patience is a Virtue: The Effect of Slack on Competitiveness for Admission Control
 SODA'99
, 1999
"... We consider the online competitiveness for scheduling a single resource nonpreemptively in order to maximize its utilization. The slack of a job is equal to the gap between its release time and the last possible time at which it may be started while still meeting its deadline. When no restrictions ..."
Abstract
 Add to MetaCart
are placed on either the length or slack of any job, previous lower bounds show that no algorithm, deterministic or randomized, can guarantee any constant bound on the competitiveness of a resulting schedule. We examine a natural restriction in which each job must o#er slack at least proportional to the job
Patience is a Virtue: The Effect of Slack on Competitiveness for Admission Control
, 1999
"... We consider the online competitiveness for scheduling a single resource nonpreemptively in order to maximize its utilization. The slack of a job is equal to the gap between its release time and the last possible time at which it may be started while still meeting its deadline. When no restrictions ..."
Abstract
 Add to MetaCart
are placed on either the length or slack of any job, previous lower bounds show that no algorithm, deterministic or randomized, can guarantee any constant bound on the competitiveness of a resulting schedule. We examine a natural restriction in which each job must o#er slack at least proportional to the job
Patience is a Virtue: The Effect of Slack on Competitiveness for Admission Control
, 2001
"... We consider the online competitiveness for scheduling a single resource nonpreemptively in order to maximize its utilization. Our work examines this model when parameterizing an instance by a new value which we term the patience. This parameter measures each job's willingness to endure a delay ..."
Abstract
 Add to MetaCart
with length kJk has a slack of at least \Delta kJk. Without any restrictions placed on the job characteristics, previous lower bounds show that no algorithm, deterministic or randomized, can guarantee a constant bound on the competitiveness of a resulting schedule. Previous researchers have analyzed a problem
Metric embeddings with relaxed guarantees
 IN PROCEEDINGS OF THE 46TH IEEE SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE
, 2005
"... We consider the problem of embedding finite metrics with slack: we seek to produce embeddings with small dimension and distortion while allowing a (small) constant fraction of all distances to be arbitrarily distorted. This definition is motivated by recent research in the networking community, whic ..."
Abstract

Cited by 25 (6 self)
 Add to MetaCart
We consider the problem of embedding finite metrics with slack: we seek to produce embeddings with small dimension and distortion while allowing a (small) constant fraction of all distances to be arbitrarily distorted. This definition is motivated by recent research in the networking community
Pitfalls and Remedies in DEA Applications: How to Handle an Occurrence of Zero in Multipliers by Strong Complementary Slackness Conditions
, 2013
"... Copyright © 2013 Toshiyuki Sueyoshi, Mika Goto. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. This study discusses a guideline on ..."
Abstract
 Add to MetaCart
on a proper use of Data Envelopment Analysis (DEA) that has been widely used for performance analysis in public and private sectors. The use of DEA is equipped with Strong Complementary Slackness Conditions (SCSCs) in this study, but an application of DEA/SCSCs depends upon its careful use
Resource Sharing in Pipelined CDFG Synthesis
"... Efficient use of limited available resources on an FPGA remains a crucial problem for synthesizing pipelined designs. Resource sharing addresses this challenge. In this paper, we propose resource sharing techniques that can be incorporated into an automated synthesis flow to generate pipelined desig ..."
Abstract
 Add to MetaCart
sharing problems of varying restrictions. Specifically, we propose an optimal algorithm for ConstantSlack Resource Sharing and a heuristic for the general IntraPipeline Stage Resource Sharing. On an average the demand on arithmetic functional units can be reduced by 39.5 % for a set of benchmarks from
Results 1  10
of
92