922 search results - page 158 / 185 » Fairness, Resources, and Separation |
105
click to vote
FOCS
2002
IEEE
15 years 3 months ago
2002
IEEE
We consider the classical vertex cover and set cover problems with the addition of hard capacity constraints. This means that a set (vertex) can only cover a limited number of its...
CPAIOR
2010
Springer
15 years 2 months ago
2010
Springer
Constrained Optimum Path (COP) problems arise in many real-life applications and are ubiquitous in communication networks. They have been traditionally approached by dedicated algo...
CDC
2009
IEEE
15 years 2 months ago
2009
IEEE
Abstract— Many problems associated with networked systems can be formulated as network utility maximization (NUM) problems. NUM problems maximize a global separable measure of ne...
100
click to vote
IWQOS
2001
Springer
15 years 2 months ago
2001
Springer
The IETF’s Integrated Services (IntServ) architecture together with reservation aggregation provide a mechanism to support the quality-of-service demands of real-time flows in a...
CSMR
2000
IEEE
15 years 2 months ago
2000
IEEE
Better understanding manual reverse engineering can make it and any associated systems reengineering more effective. We reverse engineered a version of a system (referred to as &q...