Sciweavers

1805 search results - page 12 / 361
» Functional programming with structured graphs
Sort
View
CAS
2008
118views more  CAS 2008»
13 years 7 months ago
A Novel Method for Measuring the Structural Information Content of Networks
In this paper we first present a novel approach to determine the structural information content (graph entropy) of a network represented by an undirected and connected graph. Such...
Matthias Dehmer
QUESTA
1998
124views more  QUESTA 1998»
13 years 7 months ago
Structural results for the control of queueing systems using event-based dynamic programming
In this paper we study monotonicity results for optimal policies of various queueing and resource sharing models. The standard approach is to propagate, for each specific model, ...
Ger Koole
GCB
2004
Springer
139views Biometrics» more  GCB 2004»
14 years 28 days ago
Graph Alignments: A New Concept to Detect Conserved Regions in Protein Active Sites
: We introduce the novel concept of graph alignment, a generalization of graph isomorphism that is motivated by the commonly used multiple sequence alignments. Graph alignments and...
Nils Weskamp, Eyke Hüllermeier, Daniel Kuhn, ...
CSMR
1999
IEEE
13 years 12 months ago
Impact of Function Pointers on the Call Graph
Maintenance activities are made more difficult when pointers are heavily used in source code: the programmer needs to build a mental model of memory locations and of the way they ...
Giuliano Antoniol, F. Calzolari, Paolo Tonella
ASP
2003
Springer
14 years 24 days ago
Using Nested Logic Programs for Answer Set Programming
We present a general method to improve computation of answer sets by analyzing structural properties of normal logic programs. Therefore we use labeled directed graphs associated t...
Thomas Linke