Sciweavers

11348 search results - page 1925 / 2270
» On time-scale designs for networks
Sort
View
196
Voted
NETWORKING
2008
15 years 8 months ago
The CPBT: A Method for Searching the Prefixes Using Coded Prefixes in B-Tree
Due to the increasing size of IP routing table and the growing rate of their lookups, many algorithms are introduced to achieve the required speed in table search and update or opt...
Mohammad Behdadfar, Hossein Saidi
CMS
2006
15 years 8 months ago
TAO: Protecting Against Hitlist Worms Using Transparent Address Obfuscation
Abstract. Sophisticated worms that use precomputed hitlists of vulnerable targets are especially hard to contain, since they are harder to detect, and spread at rates where even au...
Spyros Antonatos, Kostas G. Anagnostakis
DLOG
2003
15 years 8 months ago
Relationships with other Formalisms
In this chapter, we are concerned with the relationship between Description Logics and other formalisms, regardless of whether they were designed for knowledge representation issu...
Ulrike Sattler, Diego Calvanese, Ralf Molitor
IJCAI
2001
15 years 8 months ago
Executing Reactive, Model-based Programs through Graph-based Temporal Planning
In the future, webs of unmanned air and space vehicles will act together to robustly perform elaborate missions in uncertain environments. We coordinate these systems by introduci...
Phil Kim, Brian C. Williams, Mark Abramson
NSDI
2004
15 years 8 months ago
Consistent and Automatic Replica Regeneration
Reducing management costs and improving the availability of large-scale distributed systems require automatic replica regeneration, i.e., creating new replicas in response to repl...
Haifeng Yu, Amin Vahdat
« Prev « First page 1925 / 2270 Last » Next »