5030 search results - page 799 / 1006 » cases 2007 |
190
click to vote
CONEXT
2007
ACM
15 years 10 months ago
2007
ACM
Deterministic finite automata (DFAs) are widely used to perform regular expression matching in linear time. Several techniques have been proposed to compress DFAs in order to redu...
210
click to vote
CONEXT
2007
ACM
15 years 10 months ago
2007
ACM
The issue of router buffer sizing is still open and significant. Previous work either considers open-loop traffic or only analyzes persistent TCP flows. This paper differs in two ...
155
click to vote
CONEXT
2007
ACM
15 years 10 months ago
2007
ACM
Software-based traffic generators are commonly used in experimental research on computer networks. However, there are no much studies focusing on how such instruments are accurate...
203
click to vote
CONEXT
2007
ACM
15 years 10 months ago
2007
ACM
We propose an economic model based on user utility to study the adoption of new network architectures such as IPv6. We use mathematical analysis and simulation studies to understa...
182
click to vote
CP
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. Computing the minimal network (or minimal CSP) representation of a given set of constraints over the Point Algebra (PA) is a fundamental reasoning problem. In this paper ...