49 search results - page 10 / 10 » Named Graphs as a Mechanism for Reasoning About Provenance |
ICCAD
2002
IEEE
14 years 2 months ago
2002
IEEE
— One of the bottlenecks in the recent movement of hardware synthesis from behavioral C programs is the difficulty in reasoning about runtime pointer values at compile time. The...
CORR
2011
Springer
12 years 9 months ago
2011
Springer
: The Bethe Permanent of a Non-Negative Matrix Pascal O. Vontobel HP Laboratories HPL-2011-116 Bethe approximation; Bethe permanent; graph cover; partition function; perfect ma...
CORR
2008
Springer
13 years 5 months ago
2008
Springer
The unsplittable flow problem is one of the most extensively studied optimization problems in the field of networking. An instance of it consists of an edge capacitated graph and ...
SOSYM
2002
13 years 5 months ago
2002
Abstract. There is rapidly growing momentum for web enabled agents that reason about and dynamically integrate the appropriate knowledge and services at run-time. The dynamic integ...