๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

An efficient algorithm for the parametric resource allocation problem

โœ Scribed by Naoki Katoh; Toshihide Ibaraki

Publisher
Elsevier Science
Year
1985
Tongue
English
Weight
571 KB
Volume
10
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

An approximation algorithm for the regis
An approximation algorithm for the register allocation problem
โœ K. Jansen; J. Reiter ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 244 KB

In this paper we study the problem of register allocation in the presence of parallel conditional branches with a given branching depth d. We start from a scheduled flow graph and the goal is to find an assignment of the variables in the flow graph to a minimum number of registers. This problem can

An efficient Nash-implementation mechani
An efficient Nash-implementation mechanism for network resource allocation
โœ Rahul Jain; Jean Walrand ๐Ÿ“‚ Article ๐Ÿ“… 2010 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 422 KB

We propose a mechanism for auctioning bundles of multiple divisible goods in a network where buyers want the same amount of bandwidth on each link in their route. Buyers can specify multiple routes (corresponding to a source-destination pair). The total flow can then be split among these multiple ro

An Efficient Algorithm for the Complex R
An Efficient Algorithm for the Complex Roots Problem
โœ C.Andrew Neff; John H. Reif ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 406 KB

Given a univariate polynomial f (z) of degree n with complex coefficients, whose norms are less than 2 m in magnitude, the root problem is to find all the roots of f (z) up to specified precision 2 ฯชศ . Assuming the arithmetic model for computation, we provide an algorithm which has complexity O(n l