10148 search results - page 1820 / 2030 » Optimal sub-graphical models |
152
click to vote
SIGCOMM
1994
ACM
15 years 10 months ago
1994
ACM
This paper discusses congestion control from a game-theoretic perspective. There are two basic premises: (1) users are assumed to be independent and sel sh, and (2) central admini...
192
click to vote
SPAA
1994
ACM
15 years 10 months ago
1994
ACM
We analyze the performance of greedy routing for array networks by providing bounds on the average delay and the average number of packets in the system for the dynamic routing pr...
136
click to vote
APPROX
2007
Springer
15 years 10 months ago
2007
Springer
We study the Steiner Tree problem in the model of two-stage stochastic optimization with non-uniform inflation factors, and give a poly-logarithmic approximation factor for this pr...
154
click to vote
ASPDAC
2007
ACM
15 years 10 months ago
2007
ACM
Parallel prefix adder is the most flexible and widely-used binary adder for ASIC designs. Many high-level synthesis techniques have been developed to find optimal prefix structures...
161
click to vote
CONEXT
2007
ACM
15 years 10 months ago
2007
ACM
Community wireless mesh networks (WMNs) are increasingly being deployed for providing cheap, low maintenance Internet access. For the successful adoption of WMNs as a last-mile te...