Sciweavers

1981 search results - page 91 / 397
» The State of Change: A Survey
Sort
View
JSS
1998
90views more  JSS 1998»
15 years 6 months ago
A taxonomy of distributed termination detection algorithms
An important problem in the ®eld of distributed systems is that of detecting the termination of a distributed computation. Distributed termination detection (DTD) is a dicult p...
Jeff Matocha, Tracy Camp
GC
2010
Springer
15 years 4 months ago
20 Years of Negami's Planar Cover Conjecture
In 1988, Seiya Negami published a conjecture stating that a graph G has a finite planar cover (i.e. a homomorphism from some planar graph onto G which maps the vertex neighbourhoo...
Petr Hlinený
LPAR
2010
Springer
15 years 4 months ago
The Complexity of Partial-Observation Parity Games
We consider two-player zero-sum games on graphs. On the basis of the information available to the players these games can be classified as follows: (a) partial-observation (both p...
Krishnendu Chatterjee, Laurent Doyen
CORR
2012
Springer
182views Education» more  CORR 2012»
14 years 2 months ago
Organizing the Aggregate: Languages for Spatial Computing
As the number of computing devices embedded into engineered systems continues to rise, there is a widening gap between the needs of the user to control aggregates of devices and t...
Jacob Beal, Stefan Dulman, Kyle Usbeck, Mirko Viro...
FIMH
2007
Springer
16 years 16 days ago
Can We Trust the Transgenic Mouse? Insights from Computer Simulations
Abstract. Over the past several decades, the mouse has gained prominence in the cardiac electrophysiology literature as the animal model of choice. Using computer models of the mou...
Joseph Tranquillo, Adhira Sunkara