Sciweavers

CORR
2010
Springer
56views Education» more  CORR 2010»
13 years 11 months ago
Better algorithms for satisfiability problems for formulas of bounded rank-width
Robert Ganian, Petr Hlinený, Jan Obdrz&aacu...
CORR
2010
Springer
94views Education» more  CORR 2010»
13 years 11 months ago
Dynamic Observers for Fault Diagnosis of Timed Systems
Abstract-- In this paper we extend the work on dynamic observers for fault diagnosis [1], [2], [3] to timed automata. We study sensor minimization problems with static observers an...
Franck Cassez
CORR
2010
Springer
159views Education» more  CORR 2010»
13 years 11 months ago
A Novel VLSI Architecture of Fixed-complexity Sphere Decoder
Fixed-complexity sphere decoder (FSD) is a recently proposed technique for multiple-input multiple-output (MIMO) detection. It has several outstanding features such as constant thr...
Bin Wu, Guido Masera
CORR
2010
Springer
92views Education» more  CORR 2010»
13 years 11 months ago
Promoting Component Reuse by Separating Transmission Policy from Implementation
In this paper we present a methodology and set of tools which assist the construction of applications from components, by separating the issues of transmission policy from compone...
Scott M. Walker, Alan Dearle, Graham N. C. Kirby, ...
CORR
2010
Springer
123views Education» more  CORR 2010»
13 years 11 months ago
A Peer-to-Peer Middleware Framework for Resilient Persistent Programming
The persistent programming systems of the 1980s offered a programming model that integrated computation and long-term storage. In these systems, reliable applications could be eng...
Alan Dearle, Graham N. C. Kirby, Stuart J. Norcros...
CORR
2010
Springer
77views Education» more  CORR 2010»
13 years 11 months ago
An upper bound on the number of states for a strongly universal hyperbolic cellular automaton on the pentagrid
In this paper, following the way opened by a previous paper deposited on arXiv, see[7], we give an upper bound to the number of states for a hyperbolic cellular automaton in the pe...
Maurice Margenstern
CORR
2010
Springer
101views Education» more  CORR 2010»
13 years 11 months ago
Universal Loop-Free Super-Stabilization
Abstract. We propose an univesal scheme to design loop-free and superstabilizing protocols for constructing spanning trees optimizing any tree metrics (not only those that are isom...
Lélia Blin, Maria Potop-Butucaru, Stephane ...
CORR
2010
Springer
127views Education» more  CORR 2010»
13 years 11 months ago
Extended core and choosability of a graph
A graph G is (a, b)-choosable if for any color list of size a associated with each vertices, one can choose a subset of b colors such that adjacent vertices are colored with disjoi...
Yves Aubry, Godin Jean-Christophe, Togni Olivier