Sciweavers

2555 search results - page 111 / 511
» Quantifiers and Working Memory
Sort
View
INFOCOM
2005
IEEE
15 years 3 months ago
IPStash: a set-associative memory approach for efficient IP-lookup
—IP-Lookup is a challenging problem because of the increasing routing table sizes, increased traffic, and higher speed links. These characteristics lead to the prevalence of hard...
Stefanos Kaxiras, Georgios Keramidas
82
Voted
SPAA
2010
ACM
15 years 3 months ago
Delays induce an exponential memory gap for rendezvous in trees
The aim of rendezvous in a graph is meeting of two mobile agents at some node of an unknown anonymous connected graph. The two identical agents start from arbitrary nodes in the g...
Pierre Fraigniaud, Andrzej Pelc
FASE
2006
Springer
15 years 1 months ago
Trace-Based Memory Aliasing Across Program Versions
One of the major costs of software development is associated with testing and validation of successive versions of software systems. An important problem encountered in testing and...
Murali Krishna Ramanathan, Suresh Jagannathan, Ana...
98
Voted
ANCS
2009
ACM
14 years 8 months ago
Progressive hashing for packet processing using set associative memory
As the Internet grows, both the number of rules in packet filtering databases and the number of prefixes in IP lookup tables inside the router are growing. The packet processing e...
Michel Hanna, Socrates Demetriades, Sangyeun Cho, ...
CHI
2007
ACM
15 years 10 months ago
Software or wetware?: discovering when and why people use digital prosthetic memory
Our lives are full of memorable and important moments, as well as important items of information. The last few years have seen the proliferation of digital devices intended to sup...
Steve Whittaker, Vaiva Kalnikaité