Sciweavers

1429 search results - page 28 / 286
» The Complexity of the Approximation of the Bandwidth Problem
Sort
View
CN
2007
88views more  CN 2007»
13 years 7 months ago
Channel sharing by multi-class rate adaptive streams: Performance region and optimization
We consider the problem of channel sharing by rate adaptive streams belonging to various classes. The performance measure per class is the average scaled bandwidth allocated to co...
Nikos Argiriou, Leonidas Georgiadis
ISCC
2006
IEEE
134views Communications» more  ISCC 2006»
14 years 1 months ago
A Proposed Framework for Calibration of Available Bandwidth Estimation Tools
Examining the validity or accuracy of proposed available bandwidth estimation tools remains a challenging problem. A common approach consists of evaluating a newly developed tool ...
Joel Sommers, Paul Barford, Walter Willinger
ATAL
2007
Springer
13 years 11 months ago
A swarm based approximated algorithm to the extended generalized assignment problem (E-GAP)
This paper addresses distributed task allocation in complex scenarios modeled using the distributed constraint optimization problem (DCOP) formalism. We propose and evaluate a nov...
Paulo Roberto Ferreira Jr., Felipe S. Boffo, Ana L...
DAM
2006
78views more  DAM 2006»
13 years 7 months ago
Hybrid rounding techniques for knapsack problems
We address the classical knapsack problem and a variant in which an upper bound is imposed on the number of items that can be selected. We show that appropriate combinations of ro...
Monaldo Mastrolilli, Marcus Hutter
ISCC
2005
IEEE
143views Communications» more  ISCC 2005»
14 years 1 months ago
Approximating Optimal Multicast Trees in Wireless Multihop Networks
— We study the problem of computing minimal cost multicast trees in multi-hop wireless mesh networks. This problem is known as the Steiner tree problem, and it has been widely st...
Pedro M. Ruiz, Antonio F. Gómez-Skarmeta