Sciweavers

608 search results - page 55 / 122
» Random Systems with Complete Connections
Sort
View
SIAMCOMP
1998
125views more  SIAMCOMP 1998»
14 years 9 months ago
Free Bits, PCPs, and Nonapproximability-Towards Tight Results
This paper continues the investigation of the connection between probabilistically checkable proofs (PCPs) and the approximability of NP-optimization problems. The emphasis is on p...
Mihir Bellare, Oded Goldreich, Madhu Sudan
CF
2007
ACM
15 years 1 months ago
Massively parallel processing on a chip
MppSoC is a SIMD architecture composed of a grid of processors and memories connected by a X-Net neighbourhood network and a general purpose global router. MppSoC is an evolution ...
Philippe Marquet, Simon Duquennoy, Sébastie...
HCI
2007
14 years 11 months ago
Design of an Adaptive Feedback Based Steering Wheel
This paper aims at describing the architectural model of an adaptive force-feedback for a By Wire steering wheel system. This solution uses a steering wheel to replicate the reacti...
Mauro Dell'Amico, Stefano Marzani, Luca Minin, Rob...
INFOCOM
2003
IEEE
15 years 3 months ago
Heavy tailed M/G/1-PS queues with impatience and admission control in packet networks
Abstract—In this paper we analyze the M/G/1 processor sharing queue with heavy tailed services and with impatient customers. It is assumed that impatience depends on the value of...
Jacqueline Boyer, Fabrice Guillemin, Philippe Robe...
GD
1998
Springer
15 years 2 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