Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Journal=Networks AND YEAR=1990
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A graph-theoretic approach to investigate structural and qualitative properties of systems: A survey
Takeo Yamada
,
Leslie R. Foulds
Networks
20
(4), 1990, pp. 427-452
Algorithms for special cases of rectilinear Steiner trees: I. Points on the boundary of a rectilinear rectangle
Pankaj Kumar Agarwal
,
Man-Tak Shing
Networks
20
(4), 1990, pp. 453-485
Independence properties of directed Markov fields
S.L. Lauritzen
,
A.P. Dawid
,
B.N. Larsen
,
H.-G. Leimer
Networks
20
(5), 1990, pp. 491-505
Identifying independence in Bayesian networks
Dan Geiger
,
Thomas Verma
,
Judea Pearl
Networks
20
(5), 1990, pp. 507-534
An ordered examination of influence diagrams
Ross D. Shachter
Networks
20
(5), 1990, pp. 535-563
Medical diagnosis using influence diagrams
Carlos Alberto de Bragança Pereira
,
Richard E. Barlow
Networks
20
(5), 1990, pp. 565-577
Sequential updating of conditional probabilities on directed graphical structures
David J. Spiegelhalter
,
Steffen L. Lauritzen
Networks
20
(5), 1990, pp. 579-605
Probabilistic similarity networks
David Heckerman
Networks
20
(5), 1990, pp. 607-636
An algebra of Bayesian belief universes for knowledge-based systems
Finn Verner Jensen
,
Kristian G. Olesen
,
Stig Kjaer Andersen
Networks
20
(5), 1990, pp. 637-659
A randomized approximation algorithm for probabilistic inference on Bayesian belief networks
R. Martin Chavez
,
Gregory F. Cooper
Networks
20
(5), 1990, pp. 661-685
Graphical inference in qualitative probabilistic networks
Michael P. Wellman
Networks
20
(5), 1990, pp. 687-701
Matching problems with generalized upper bound side constraints
Michael O. Ball
,
Ulrich Derigs
,
C. Hilbrand
,
Achim Metz
Networks
20
(6), 1990, pp. 703-721
On the construction of optimally reliable graphs
Derek H. Smith
,
Lynne L. Doty
Networks
20
(6), 1990, pp. 723-729
Hierarchical solution of network flow problems
V. Ananth Iyer
,
John J. Jarvis
,
H. Donald Ratliff
Networks
20
(6), 1990, pp. 731-752
Time-dependent Traveling-Salesmanc problem - The Deliveryman case
Abilio Lucena
Networks
20
(6), 1990, pp. 753-763
A lower bound for the Steiner tree problem in directed graphs
Weiguo Liu
Networks
20
(6), 1990, pp. 765-778
Worst-case greedy matchings in the unit
d
-cube
Timothy Law Snyder
,
J. Michael Steele
Networks
20
(6), 1990, pp. 779-800
Optimal locations and districts of two Traveling Salesmen on a tree
David Simchi-Levi
,
Oded Berman
Networks
20
(7), 1990, pp. 803-815
The search game on a network with immobile hider
E.J. Anderson
,
M.A. Aramendia
Networks
20
(7), 1990, pp. 817-844
The network simplex method on a multiprocessor
Jörg Peters
Networks
20
(7), 1990, pp. 845-859
Predicting deadlock in store-and-forward networks
Claudio Arbib
,
Giuseppe F. Italiano
,
Alessandro Panconesi
Networks
20
(7), 1990, pp. 861-881
Efficient algorithms for computing the reliability of permutation and interval graphs
Hosam M. AboElFotoh
,
Charles J. Colbourn
Networks
20
(7), 1990, pp. 883-898
Seiten
<
1
2