Sciweavers

2043 search results - page 236 / 409
» Some Basics on Tolerances
Sort
View
ICALP
2010
Springer
15 years 11 months ago
Network Design via Core Detouring for Problems without a Core
Some of the currently best-known approximation algorithms for network design are based on random sampling. One of the key steps of such algorithms is connecting a set of source nod...
Fabrizio Grandoni, Thomas Rothvoß
SAC
2000
ACM
15 years 11 months ago
A Mobile Agent Infrastructure for the Mobility Support
The mobility of terminals and users is a crucial issue in the open global system represented by the Internet. Supporting terminal and user mobility requires a middleware infrastru...
Paolo Bellavista, Antonio Corradi, Cesare Stefanel...
CP
1998
Springer
15 years 10 months ago
Generation of Test Patterns for Differential Diagnosis of Digital Circuits
In a faulty digital circuit, many (single) faulty gates may explain the observed findings. In this paper we are mostly concerned, not in obtaining alternative diagnoses, but rathe...
Francisco Azevedo, Pedro Barahona
EPS
1998
Springer
15 years 10 months ago
Complete Classes of Strategies for the Classical Iterated Prisoner's Dilemma
The Classical Iterated Prisoner's Dilemma (CIPD) is used to study the evolution of cooperation. We show, with a genetic approach, how basic ideas could be used in order to gen...
Bruno Beaufils, Jean-Paul Delahaye, Philippe Mathi...
GD
1998
Springer
15 years 10 months ago
Using Graph Layout to Visualize Train Interconnection Data
We consider the problem of visualizing interconnections in railway systems. Given time tables from systems with thousands of trains, we are to visualize basic properties of the co...
Ulrik Brandes, Dorothea Wagner