Sciweavers

5699 search results - page 19 / 1140
» Alternating model trees
Sort
View
VLSID
2006
IEEE
86views VLSI» more  VLSID 2006»
15 years 11 months ago
Partial Product Reduction Based on Look-Up Tables
In this paper a new technique for partial product reduction based on the use of look-up tables for efficient processing is presented. We describe how to construct counter devices ...
F. Pujol López, Higinio Mora Mora, Jer&oacu...
ICNP
2002
IEEE
15 years 3 months ago
Dynamic Routing of Bandwidth Guaranteed Multicasts with Failure Backup
This paper presents a new algorithm for dynamic routing of bandwidth guaranteed multicast tunnels with failure backup. The multicast routing problem arises in many contexts such a...
Murali S. Kodialam, T. V. Lakshman
STACS
2007
Springer
15 years 5 months ago
Testing Convexity Properties of Tree Colorings
A coloring of a graph is convex if it induces a partition of the vertices into connected subgraphs. Besides being an interesting property from a theoretical point of view, tests f...
Eldar Fischer, Orly Yahalom
101
Voted
FCT
2007
Springer
15 years 5 months ago
On the Topological Complexity of Weakly Recognizable Tree Languages
We show that the family of tree languages recognized by weak alternating automata is closed by three set theoretic operations that correspond to sum, multiplication by ordinals <...
Jacques Duparc, Filip Murlak
IEEEARES
2006
IEEE
15 years 4 months ago
Modeling Dependable Systems using Hybrid Bayesian Networks
A hybrid Bayesian Network (BN) is one that incorporates both discrete and continuous nodes. In our extensive applications of BNs for system dependability assessment the models are...
Martin Neil, Manesh Tailor, Norman E. Fenton, Davi...