7280 search results - page 1398 / 1456 » Optimization Techniques |
FOCS
2006
IEEE
15 years 5 months ago
2006
IEEE
A family of subsets C of [n] def = {1, . . . , n} is (r, t)exclusive if for every S ⊂ [n] of size at least n − r, there exist S1, . . . , St ∈ C with S = S1∪S2∪· · · ...
ICDE
2006
IEEE
15 years 5 months ago
2006
IEEE
Users tend to use the Internet for “resource-hungry” applications (which involve content such as video, audio on-demand and distributed data) and at the same time, more and mo...
IEEEPACT
2006
IEEE
15 years 5 months ago
2006
IEEE
Modeling and analysis of program behavior are at the foundation of computer system design and optimization. As computer systems become more adaptive, their efficiency increasingly...
111
click to vote
INFOCOM
2006
IEEE
15 years 5 months ago
2006
IEEE
We consider a class of queueing networks referred to as “generalized constrained queueing networks” which form the basis of several different communication networks and inform...
INFOCOM
2006
IEEE
15 years 5 months ago
2006
IEEE
—Routing algorithms such as Distance Vector and Link States have the routing table size as ΩΩΩΩ (n), where n is the number of destination identifiers, thus providing only...