16430 search results - page 75 / 3286 » On Computable Tree Functions |
127
click to vote
CIAC
2000
Springer
15 years 6 months ago
2000
Springer
A minimum spanning tree (MST) with a small diameter is required in numerous practical situations. It is needed, for example, in distributed mutual exclusion algorithms in order to ...
111
click to vote
ISPDC
2008
IEEE
15 years 8 months ago
2008
IEEE
We present a load-balancing technique that exploits the temporal coherence, among successive computation phases, in mesh-like computations to be mapped on a cluster of processors....
122
click to vote
WSCG
2003
15 years 3 months ago
2003
In this paper, a recursive algorithm that can build complex tree structure quickly is presented briefly. The plant structural growth is based on a dual-scale automaton, in which ā...
123
click to vote
JVA
2006
IEEE
15 years 8 months ago
2006
IEEE
We present a natural deduction calculus for the computation tree logic CTL deļ¬ned with the full set of classical and temporal logic operators. The system extends the natural ded...
112
Voted
JSC
2007
15 years 2 months ago
2007
We generalize the concept of a cycle from graphs to simplicial complexes. We show that a simplicial cycle is either a sequence of facets connected in the shape of a circle, or is ...