5658 search results - page 95 / 1132 » An Efficient Counting Network |
ECAI
2008
Springer
13 years 12 months ago
2008
Springer
The objective of the Maximal Constraint Satisfaction Problem (Max-CSP) is to find an instantiation which minimizes the number of constraint violations in a constraint network. In t...
SIGMETRICS
2008
ACM
13 years 10 months ago
2008
ACM
Network traffic modeling generally views traffic as a superposition of flows that creates a timeseries of volume counts (e.g. of bytes or packets). What is omitted from this view ...
CCR
1998
13 years 9 months ago
1998
This paper presents a simulation study of various TCP acknowledgment generation and utilization techniques. We investigate the standard version of TCP and the two standard acknowl...
SIGMETRICS
2005
ACM
14 years 3 months ago
2005
ACM
Network service providers and customers are often concerned with aggregate performance measures that span multiple network paths. Unfortunately, forming such network-wide measures ...
ICALP
2009
Springer
14 years 1 months ago
2009
Springer
Intuitively, Braess's paradox states that destroying a part of a network may improve the common latency of selfish flows at Nash equilibrium. Such a paradox is a pervasive phe...