Sciweavers

209 search results - page 31 / 42
» Computing a Diameter-Constrained Minimum Spanning Tree in Pa...
Sort
View
DAM
2007
107views more  DAM 2007»
14 years 9 months ago
Eliminating graphs by means of parallel knock-out schemes
In 1997 Lampert and Slater introduced parallel knock-out schemes, an iterative process on graphs that goes through several rounds. In each round of this process, every vertex elim...
Hajo Broersma, Fedor V. Fomin, Rastislav Kralovic,...
ISPA
2005
Springer
15 years 3 months ago
Ethernet as a Lossless Deadlock Free System Area Network
The way conventional Ethernet is used today differs in two aspects from how dedicated system area networks are used. Firstly, dedicated system area networks are lossless and only d...
Sven-Arne Reinemo, Tor Skeie
BMCBI
2005
147views more  BMCBI 2005»
14 years 9 months ago
Calibration of mass spectrometric peptide mass fingerprint data without specific external or internal calibrants
Background: Peptide Mass Fingerprinting (PMF) is a widely used mass spectrometry (MS) method of analysis of proteins and peptides. It relies on the comparison between experimental...
Witold E. Wolski, Maciej Lalowski, Peter Jungblut,...
IPPS
2007
IEEE
15 years 3 months ago
A Model for Large Scale Self-Stabilization
We introduce a new model for distributed algorithms designed for large scale systems that need a low-overhead solution to allow the processes to communicate with each other. We as...
Thomas Hérault, Pierre Lemarinier, Olivier ...
IPPS
2003
IEEE
15 years 2 months ago
Founding FireWire Bridges through Promela Prototyping
The standardisation procedure of the IEEE P1394.1 Draft Standard for High Performance Serial Bus Bridges is supported through the use of the state-of-the-art model checker Spin, w...
Izak van Langevelde, Judi Romijn, Nicolae Goga