UB Paderborn / Katalog / Suche / in CDI

Sortiert nach

Einfacher Volltextzugriff von (fast) überall

Installieren Sie die LibKey Nomad-Browsererweiterung und erhalten Sie von vielen Webseiten einfachen Zugriff auf lizenzierte Volltexte oder Open Access Publikationen. Mehr erfahren...

On Graphical Modeling of Preference and Importance

The Journal of artificial intelligence research, 2006-01, Vol.25, p.389-424

2006

Volltextzugriff (PDF)

Optimal ordering of independent tests with precedence constraints

Discrete Applied Mathematics, 2014-01, Vol.162, p.115-127

2014

Volltextzugriff (PDF)

Support measures for graph data

Data mining and knowledge discovery, 2006-09, Vol.13 (2), p.243-260

2006

Volltextzugriff (PDF)

Cost-based abduction and MAP explanation

Artificial intelligence, 1994-04, Vol.66 (2), p.345-374

1994

Volltextzugriff (PDF)

Complexity of probabilistic reasoning in directed-path singly-connected Bayes networks

Artificial intelligence, 2003-12, Vol.151 (1), p.213-225

2003

Volltextzugriff (PDF)

Complexity of Canadian traveler problem variants

Theoretical computer science, 2013-05, Vol.487, p.1-16

2013

Volltextzugriff (PDF)

Semimyopic Measurement Selection for Optimization Under Uncertainty

IEEE transactions on cybernetics, 2012-04, Vol.42 (2), p.565-579

2012

Volltextzugriff (PDF)

Approximate belief updating in max-2-connected Bayes networks is NP-hard

Artificial intelligence, 2009-08, Vol.173 (12), p.1150-1153

2009

Volltextzugriff (PDF)

Discovering Frequent Graph Patterns Using Disjoint Paths

IEEE transactions on knowledge and data engineering, 2006-11, Vol.18 (11), p.1441-1456

2006

Volltextzugriff (PDF)

FlexiMine – A Flexible Platform for KDD Research and Application Development

Annals of mathematics and artificial intelligence, 2003-09, Vol.39 (1-2), p.175-204

2003

Volltextzugriff (PDF)

Finding MAPs for belief networks is NP-hard

Artificial intelligence, 1994-08, Vol.68 (2), p.399-410

Shimony, Solomon Eyal

1994

Volltextzugriff (PDF)

A probabilistic spatial data model

Information sciences, 1996, Vol.90 (1), p.51-74

1996

Volltextzugriff (PDF)

Computing frequent graph patterns from semistructured data

2002 IEEE International Conference on Data Mining, 2002. Proceedings, 2002, p.458-465

2002

Volltextzugriff (PDF)

Algorithms for parsimonious complete sets in directed graphs

Information processing letters, 1996-09, Vol.59 (6), p.335-339

1996

Volltextzugriff (PDF)

Prioritizing Point-Based POMDP Solvers

IEEE transactions on cybernetics, 2008-12, Vol.38 (6), p.1592-1605

2008

Volltextzugriff (PDF)

Deterministic approximation of marginal probabilities in Bayes nets

IEEE transactions on systems, man and cybernetics. Part A, Systems and humans, 1998-07, Vol.28 (4), p.377-393

1998

Volltextzugriff (PDF)

Model-Based Online Learning of POMDPs

Lecture notes in computer science, 2005, p.353-364

1ère éd, 2005

Volltextzugriff (PDF)

Implicitly preserving semantics during incremental knowledge base acquisition under uncertainty

International journal of approximate reasoning, 2003-04, Vol.33 (1), p.71-94

2003

Volltextzugriff (PDF)

Qualitative decision making in adaptive presentation of structured information

ACM transactions on information systems, 2004-10, Vol.22 (4), p.503-539

2004

Volltextzugriff (PDF)

Finding MAPs for belif networks in NP-hard

Artificial intelligence, 1994, Vol.68 (2), p.399-410

SHIMONY, S. E

1994

Volltextzugriff (PDF)

Efficient probabilistic reasoning in BNs with mutual exclusion and context-specific independence

International journal of intelligent systems, 2004-08, Vol.19 (8), p.703-725

2004

Volltextzugriff (PDF)

Reasoning with BKBs – Algorithms and Complexity

Annals of mathematics and artificial intelligence, 2004-03, Vol.40 (3/4), p.403-425

2004

Volltextzugriff (PDF)

Tambalocoque: for a formal account of the gist of a scholarly argument

Knowledge organization, 1996-01, Vol.23 (3), p.135-146

1996

Volltextzugriff (PDF)

Discovery of context-specific Markov blankets

2004 IEEE International Conference on Systems, Man and Cybernetics (IEEE Cat. No.04CH37583), 2004, Vol.4, p.3833-3838 vol.4

2004

Volltextzugriff (PDF)

Generalized model for rational game tree search

2004 IEEE International Conference on Systems, Man and Cybernetics (IEEE Cat. No.04CH37583), 2004, Vol.2, p.1261-1266 vol.2

2004

Volltextzugriff (PDF)

1 – 25 von 259

Menü

Weitere Dienste

Einstellungen

On Graphical Modeling of Preference and Importance

Optimal ordering of independent tests with precedence constraints

Support measures for graph data

Cost-based abduction and MAP explanation

Complexity of probabilistic reasoning in directed-path singly-connected Bayes networks

Complexity of Canadian traveler problem variants

Semimyopic Measurement Selection for Optimization Under Uncertainty

Approximate belief updating in max-2-connected Bayes networks is NP-hard

Discovering Frequent Graph Patterns Using Disjoint Paths

FlexiMine – A Flexible Platform for KDD Research and Application Development

Finding MAPs for belief networks is NP-hard

A probabilistic spatial data model

Computing frequent graph patterns from semistructured data

Algorithms for parsimonious complete sets in directed graphs

Prioritizing Point-Based POMDP Solvers

Deterministic approximation of marginal probabilities in Bayes nets

Model-Based Online Learning of POMDPs

Implicitly preserving semantics during incremental knowledge base acquisition under uncertainty

Qualitative decision making in adaptive presentation of structured information

Finding MAPs for belif networks in NP-hard

Efficient probabilistic reasoning in BNs with mutual exclusion and context-specific independence

Reasoning with BKBs – Algorithms and Complexity

Tambalocoque: for a formal account of the gist of a scholarly argument

Discovery of context-specific Markov blankets

Generalized model for rational game tree search

Suchergebnisse filtern