Sciweavers

12193 search results - page 2236 / 2439
» It's not all about
Sort
View
MFCS
2007
Springer
16 years 20 days ago
Finding Paths Between Graph Colourings: PSPACE-Completeness and Superpolynomial Distances
Suppose we are given a graph G together with two proper vertex k-colourings of G, α and β. How easily can we decide whether it is possible to transform α into β by recolouring...
Paul S. Bonsma, Luis Cereceda
MFCS
2007
Springer
16 years 20 days ago
Communication in Networks with Random Dependent Faults
The aim of this paper is to study communication in networks where nodes fail in a random dependent way. In order to capture fault dependencies, we introduce the neighborhood fault...
Evangelos Kranakis, Michel Paquette, Andrzej Pelc
MIDDLEWARE
2007
Springer
16 years 20 days ago
Fair access to scarce resources in ad-hoc grids using an economic-based approach
In ad-hoc Grids where the availability of resources and tasks changes over the time, distributing the tasks among the scarce resources in a balanced way is a challenging task. In ...
Behnaz Pourebrahimi, Koen Bertels
RV
2007
Springer
130views Hardware» more  RV 2007»
16 years 20 days ago
Statistical Runtime Checking of Probabilistic Properties
Probabilistic correctness is another important aspect of reliable systems. A soft real-time system, for instance, exhibits probabilistic behaviors from tolerating some degrees of ...
Usa Sammapun, Insup Lee, Oleg Sokolsky, John Regeh...
SAS
2007
Springer
108views Formal Methods» more  SAS 2007»
16 years 20 days ago
Programming Language Design and Analysis Motivated by Hardware Evolution
Abstract. Silicon chip design has passed a threshold whereby exponentially increasing transistor density (Moore’s Law) no longer translates into increased processing power for si...
Alan Mycroft
« Prev « First page 2236 / 2439 Last » Next »