Sciweavers

1429 search results - page 120 / 286
» The Complexity of the Approximation of the Bandwidth Problem
Sort
View
ICASSP
2009
IEEE
14 years 3 months ago
A differential geometric approach to discrete-coefficient filter design
This paper is concerned with the problem of computing a discretecoefficient approximation to a digital filter. In contrast to earlier works that have approached this problem usi...
Subramanian Ramamoorthy, Lothar Wenzel, James Nagl...
SIGECOM
2005
ACM
101views ECommerce» more  SIGECOM 2005»
14 years 2 months ago
Fairness and optimality in congestion games
We study two problems, that of computing social optimum and that of finding fair allocations, in the congestion game model of Milchtaich[8] Although we show that the general prob...
Deeparnab Chakrabarty, Aranyak Mehta, Viswanath Na...
INFOCOM
2000
IEEE
14 years 1 months ago
Optimal Partition of QoS requirements with Discrete Cost Functions
Abstract—The future Internet is expected to support applications with quality of service (QoS) requirements. For this end several mechanisms are suggested in the IETF to support ...
Danny Raz, Yuval Shavitt
SAGA
2009
Springer
14 years 3 months ago
Scenario Reduction Techniques in Stochastic Programming
Stochastic programming problems appear as mathematical models for optimization problems under stochastic uncertainty. Most computational approaches for solving such models are base...
Werner Römisch
BXML
2004
13 years 10 months ago
Using semantic Web services for ad hoc collaboration in virtual teams
: The system presented in this paper shows an alternative solution for the communication problem in virtual teams. Although it does not address the full bandwidth of tasks of an gr...
Matthias Flügge, Kay-Uwe Schmidt