Sciweavers

3229 search results - page 149 / 646
» Theories with the Independence Property
Sort
View
51
Voted
IPPS
2006
IEEE
15 years 6 months ago
A self-stabilizing minimal dominating set algorithm with safe convergence
A self-stabilizing distributed system is a faulttolerant distributed system that tolerates any kind and any finite number of transient faults, such as message loss and memory cor...
Hirotsugu Kakugawa, Toshimitsu Masuzawa
CAI
2007
Springer
15 years 7 months ago
From Algebraic Graph Transformation to Adhesive HLR Categories and Systems
In this paper, we present an overview of algebraic graph transformation in the double pushout approach. Basic results concerning independence, parallelism, concurrency, embedding, ...
Ulrike Prange, Hartmut Ehrig
87
Voted
CIE
2010
Springer
15 years 5 months ago
On the Completeness of Quantum Computation Models
The notion of computability is stable (i.e. independent of the choice of an indexing) over infinite-dimensional vector spaces provided they have a finite “tensorial dimension...
Pablo Arrighi, Gilles Dowek
118
Voted
ISCI
2008
74views more  ISCI 2008»
15 years 24 days ago
Strong limit theorems for random sets and fuzzy random sets with slowly varying weights
Theories of random sets and fuzzy random sets are useful concepts which are frequently applied in scientific areas including information science, probability and statistics. In th...
Ke-ang Fu, Li-xin Zhang
ISPDC
2005
IEEE
15 years 6 months ago
A Strategyproof Mechanism for Scheduling Divisible Loads in Distributed Systems
An important scheduling problem is the one in which there are no dependencies between tasks and the tasks can be of arbitrary size. This is known as the divisible load scheduling ...
Daniel Grosu, Thomas E. Carroll