Sciweavers

3211 search results - page 256 / 643
» On the Grundy Number of a Graph
Sort
View
AGTIVE
2007
Springer
16 years 24 days ago
Ludo: A Case Study for Graph Transformation Tools
In this paper we describe the Ludo case, one of the case studies of the AGTIVE 2007 Tool Contest (see [22]). After summarising the case description, we give an overview of the subm...
Arend Rensink, Alexander Dotor, Claudia Ermel, Ste...
AUSAI
2005
Springer
16 years 4 days ago
Conditioning Graphs: Practical Structures for Inference in Bayesian Networks
Abstract. Programmers employing inference in Bayesian networks typically rely on the inclusion of the model as well as an inference engine into their application. Sophisticated inf...
Kevin Grant, Michael C. Horsch
LOPSTR
2004
Springer
15 years 12 months ago
Graph-Based Proof Counting and Enumeration with Applications for Program Fragment Synthesis
For use in earlier approaches to automated module interface adaptation, we seek a restricted form of program synthesis. Given some typing assumptions and a desired result type, we ...
J. B. Wells, Boris Yakobowski
HAIS
2010
Springer
15 years 11 months ago
Graph-Based Model-Selection Framework for Large Ensembles
The intuition behind ensembles is that different prediciton models compensate each other’s errors if one combines them in an appropriate way. In case of large ensembles a lot of...
Krisztian Buza, Alexandros Nanopoulos, Lars Schmid...
ICCAD
2000
IEEE
149views Hardware» more  ICCAD 2000»
15 years 11 months ago
Dynamic Response Time Optimization for SDF Graphs
Synchronous Data Flow (SDF) is a well-known model of computation that is widely used in the control engineering and digital signal processing domains. Existing scheduling methods ...
Dirk Ziegenbein, Jan Uerpmann, Ralph Ernst