1986 search results - page 290 / 398 » Path Separability of Graphs |
106
Voted
FOGA
2007
15 years 3 months ago
2007
Barrier trees are a convenient way of representing the structure of complex combinatorial landscapes over graphs. Here we generalize the concept of barrier trees to landscapes de�...
128
click to vote
AAAI
1990
15 years 3 months ago
1990
The Symbolic Probabilistic Inference (SPI) Algorithm [D'Ambrosio, 19891 provides an efficient framework for resolving general queries on a belief network. It applies the conc...
120
click to vote
CCCG
2009
15 years 3 months ago
2009
We study a maximum flow problem in a polygonal domain P: Determine the maximum number of disjoint "thick" paths (of specified width w) through P from a source edge to a ...
110
click to vote
AUTOMATICA
2008
15 years 2 months ago
2008
In this paper, we study the property of generic uniform observability for structured bilinear systems. More precisely, to check whether or not a structured bilinear system generic...
127
click to vote
BIOINFORMATICS
2008
15 years 2 months ago
2008
Motivation: For many biotechnological purposes, it is desirable to redesign proteins to be more structurally and functionally stable at higher temperatures. For example, chemical ...