Sciweavers

107 search results - page 7 / 22
» Approximating Fair Use in LicenseScript
Sort
View
SODA
2008
ACM
108views Algorithms» more  SODA 2008»
14 years 10 months ago
Price based protocols for fair resource allocation: convergence time analysis and extension to Leontief utilities
We analyze several distributed, continuous time protocols for a fair allocation of bandwidths to flows in a network (or resources to agents). Our protocols converge to an allocati...
Ashish Goel, Hamid Nazerzadeh
PPAM
2007
Springer
15 years 3 months ago
A Parallel Approximation Algorithm for the Weighted Maximum Matching Problem
Abstract. We consider the problem of computing a weighted edge matching in a large graph using a parallel algorithm. This problem has application in several areas of combinatorial ...
Fredrik Manne, Rob H. Bisseling
WSC
2004
14 years 10 months ago
Experimental Performance Evaluation of Histogram Approximation for Simulation Output Analysis
We summarize the results of an experimental performance evaluation of using an empirical histogram to approximate the steady-state distribution of the underlying stochastic proces...
E. Jack Chen, W. David Kelton
69
Voted
ICCCN
2008
IEEE
15 years 3 months ago
Can Bilateral ISP Peering Lead to Network-Wide Cooperative Settlement
— The Internet includes thousands of Internet service providers (ISPs) which are interconnected to provide connectivity and service for end-users. Traditionally, the settlement b...
Yang Cheung, Dah-Ming Chiu, Jianwei Huang
CORR
2011
Springer
167views Education» more  CORR 2011»
14 years 4 months ago
On Quadratic Programming with a Ratio Objective
Quadratic Programming (QP) is the well-studied problem of maximizing over {−1, 1} values the quadratic form i=j aijxixj. QP captures many known combinatorial optimization proble...
Aditya Bhaskara, Moses Charikar, Rajsekar Manokara...