Sciweavers

1127 search results - page 207 / 226
» New Algorithms for Generalized Network Flows
Sort
View
SIGCOMM
2010
ACM
14 years 10 months ago
Achieving O(1) IP lookup on GPU-based software routers
IP address lookup is a challenging problem due to the increasing routing table size, and higher line rate. This paper investigates a new way to build an efficient IP lookup scheme...
Jin Zhao, Xinya Zhang, Xin Wang, Xiangyang Xue
TSMC
2002
156views more  TSMC 2002»
14 years 9 months ago
Varieties of learning automata: an overview
Automata models of learning systems introduced in the 1960s were popularized as learning automata (LA) in a survey paper in 1974 [1]. Since then, there have been many fundamental a...
M. A. L. Thathachar, P. Shanti Sastry
HUC
2010
Springer
14 years 8 months ago
Routine as resource for the design of learning systems
Even though the coordination of kids’ activities is largely successful, the modern dual income family still regularly experiences breakdowns in their practices. Families often r...
Scott Davidoff
INFOCOM
2012
IEEE
13 years 12 days ago
The Variable-Increment Counting Bloom Filter
—Counting Bloom Filters (CBFs) are widely used in networking device algorithms. They implement fast set representations to support membership queries with limited error, and supp...
Ori Rottenstreich, Yossi Kanizo, Isaac Keslassy
PODC
2004
ACM
15 years 3 months ago
Analyzing Kleinberg's (and other) small-world Models
We analyze the properties of Small-World networks, where links are much more likely to connect “neighbor nodes” than distant nodes. In particular, our analysis provides new re...
Charles U. Martel, Van Nguyen