Sciweavers

572 search results - page 5 / 115
» Formal Properties of Metrical Structure
Sort
View
UAI
2003
13 years 11 months ago
Layerwidth: Analysis of a New Metric for Directed Acyclic Graphs
We analyze a new property of directed acyclic graphs (DAGs), called layerwidth, arising from a class of DAGs proposed by Eiter and Lukasiewicz. This class of DAGs permits certain ...
Mark Hopkins
ENTCS
2007
112views more  ENTCS 2007»
13 years 10 months ago
Structure and Properties of Traces for Functional Programs
The tracer Hat records in a detailed trace the computation of a program written in the lazy functional language Haskell. The trace can then be viewed in various ways to support pr...
Olaf Chitil, Yong Luo
JUCS
2010
113views more  JUCS 2010»
13 years 4 months ago
Isometries and Computability Structures
: We investigate the relationship between computable metric spaces (X, d, ) and (X, d, ), where (X, d) is a given metric space. In the case of Euclidean space, and are equivalent ...
Zvonko Iljazovic
MFCS
2007
Springer
14 years 4 months ago
Properties Complementary to Program Self-reference
In computability theory, program self-reference is formalized by the not-necessarily-constructive form of Kleene’s Recursion Theorem (krt). In a programming system in which krt h...
John Case, Samuel E. Moelius
CODES
2006
IEEE
14 years 4 months ago
A formal approach to robustness maximization of complex heterogeneous embedded systems
Embedded system optimization typically considers objectives such as cost, timing, buffer sizes and power consumption. Robustness criteria, i.e. sensitivity of the system to variat...
Arne Hamann, Razvan Racu, Rolf Ernst