674 search results - page 76 / 135 » Resource Bound Certification |
106
click to vote
LOPSTR
2004
Springer
15 years 5 months ago
2004
Springer
We propose an analysis for detecting procedures and goals that are deterministic (i.e. that produce at most one solution), or predicates whose clause tests are mutually exclusive (...
118
click to vote
FOCS
2002
IEEE
15 years 4 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...
113
click to vote
CDC
2009
IEEE
15 years 4 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...
110
click to vote
INFOCOM
1997
IEEE
15 years 4 months ago
1997
IEEE
We propose a
ow-control scheme that combines the merits of credit- and rate-based
ow-control schemes by applying direct control over both bandwidth and bu er resources. The goal...
103
click to vote
INFOCOM
1996
IEEE
15 years 4 months ago
1996
IEEE
: We consider the combined control problem of connection admission, flow rate, and bandwidth allocation (capacity, service-rate) under nonstationary conditions. A fluid flow model ...