16430 search results - page 245 / 3286 » On Computable Tree Functions |
136
click to vote
DAC
2008
ACM
16 years 5 months ago
2008
ACM
Clock skew minimization is always very important in the clock tree synthesis. Due to clock gating, the clock tree may include different types of logic gates, e.g., AND gates, OR g...
147
click to vote
ASWEC
2007
IEEE
15 years 10 months ago
2007
IEEE
Behavior Trees (BTs) are a graphical notation used for formalising functional requirements and have been successfully applied to several case studies. However, the notation curren...
116
click to vote
SIGMETRICS
1987
ACM
15 years 8 months ago
1987
ACM
Expressions are found for the throughput and delay performance of a Tree Conflict Resolution Algorithm that is used in a Local Area Network with carrier sensing (and possibly also ...
120
click to vote
ACISICIS
2005
IEEE
15 years 6 months ago
2005
IEEE
This paper introduces a strategy and its theory proof to transform non-linear concept graph: Directed Acyclic Concept Graph (DACG) into a linear concept tree. The transformation i...
131
click to vote
COMBINATORICA
2007
15 years 4 months ago
2007
We derive a sufficient condition for a sparse graph G on n vertices to contain a copy of a tree T of maximum degree at most d on (1 − )n vertices, in terms of the expansion prop...