Sciweavers

7820 search results - page 1147 / 1564
» Formalization of Time and Space
Sort
View
WADS
2007
Springer
180views Algorithms» more  WADS 2007»
16 years 1 months ago
Spanners for Geometric Intersection Graphs
A ball graph is an intersection graph of a set of balls with arbitrary radii. Given a real number t > 1, we say that a subgraph G′ of a graph G is a t-spanner of G, if for eve...
Martin Fürer, Shiva Prasad Kasiviswanathan
ASPLOS
2006
ACM
16 years 26 days ago
Bell: bit-encoding online memory leak detection
Memory leaks compromise availability and security by crippling performance and crashing programs. Leaks are difficult to diagnose because they have no immediate symptoms. Online ...
Michael D. Bond, Kathryn S. McKinley
CONEXT
2006
ACM
16 years 26 days ago
Synergy: blending heterogeneous measurement elements for effective network monitoring
Network traffic matrices are important for various network planning and management operations. Previous work for estimation of traffic matrices is based on either link load record...
Awais Ahmed Awan, Andrew W. Moore
INFOCOM
2005
IEEE
16 years 15 days 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
PACT
2005
Springer
16 years 11 days ago
Optimal Behavior of a Moving Creature in the Cellular Automata Model
The goal of our investigation is to find automatically the best rule for a cell in the cellular automata model. The cells are either of type Obstacle, Empty or Creature. Only Crea...
Mathias Halbach, Rolf Hoffmann
« Prev « First page 1147 / 1564 Last » Next »