925 search results - page 49 / 185 » Connectivity on Complete Lattices |
105
click to vote
DLT
1993
15 years 1 months ago
1993
We concider an extened algebra of regular events (languages) with intersection besides the usual operations. This algebra has the structure of a distributive lattice with monotoni...
101
click to vote
JCT
2006
14 years 11 months ago
2006
We study the Bergman complex B(M) of a matroid M: a polyhedral complex which arises in algebraic geometry, but which we describe purely combinatorially. We prove that a natural su...
HYBRID
1997
Springer
15 years 4 months ago
1997
Springer
Abstract. Time progress conditions in hybrid systems are usually speci ed in terms of invariants, predicates characterizing states where time can continuously progress or dually, d...
EUROPAR
2005
Springer
15 years 5 months ago
2005
Springer
Maintaining spanning trees in a distributed fashion is central to many networking applications. In this paper, we propose a self-stabilizing algorithm for maintaining a spanning tr...
ESANN
2008
15 years 1 months ago
2008
We test a selection of associative memory models built with different connection strategies, exploring the relationship between the structural properties of each network and its pa...