Sciweavers

4095 search results - page 443 / 819
» How to test a tree
Sort
View
STACS
2001
Springer
15 years 10 months ago
Approximation Algorithms for the Bottleneck Stretch Factor Problem
The stretch factor of a Euclidean graph is the maximum ratio of the distance in the graph between any two points and their Euclidean distance. Given a set S of n points in Rd, we ...
Giri Narasimhan, Michiel H. M. Smid
COMPSAC
2000
IEEE
15 years 10 months ago
GAPS: A Genetic Programming System
Genetic programming tackles the issue of how to automatically create a working computer program for a given problem from some initial problem statement. The goal is accomplished i...
Michael D. Kramer, Du Zhang
DSOM
2000
Springer
15 years 10 months ago
Operational Data Analysis: Improved Predictions Using Multi-computer Pattern Detection
Operational Data Analysis (ODA) automatically 1) monitors the performance of a computer through time, 2) stores such information in a data repository, 3) applies data-mining techn...
Ricardo Vilalta, Chidanand Apté, Sholom M. ...
NDSS
1999
IEEE
15 years 10 months ago
PGRIP: PNNI Global Routing Infrastructure Protection
We describe a system for achieving PNNI (Private Network-Network Interface) Global Routing Infrastructure Protection (PGRIP). We give details of PGRIP's system-level design a...
Sabrina De Capitani di Vimercati, Patrick Lincoln,...
MM
1998
ACM
79views Multimedia» more  MM 1998»
15 years 10 months ago
Organizing Multicast Receivers Deterministically by Packet-Loss Correlation
The ability to trace multicast paths is currently available in the Internet by means of IGMP MTRACE packets. We introduce Tracer, the rst protocol that organizes the receivers of ...
Brian Neil Levine, Sanjoy Paul, J. J. Garcia-Luna-...