Yvo Desmedt, Yongge Wang  Home/Search
Context Related
| uwm.edu/~wang/papers/COCOON02.pdf Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: uwm.edu/~wang/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: AND/OR graphs and minimum-cost solution graphs have been studied extensively in artificial intelligence (see, e.g., Nilsson [14]). Generally, the AND/OR graphs are used to model problem solving processes. The minimum-cost solution graph can be used to attack the problem with the least resource. However, in many cases we want to solve the problem within the shortest time period and we assume that we have as many concurrent resources as we need to run all concurrent processes. In this paper, we... (Update)
Cited by: More
Minimal Disclosure in Hierarchical Hippocratic.. - Massacci, Mylopoulos, .. (2005) (Correct)
Hierarchical Hippocratic Databases with Minimal Disclosure for.. - Massacci (2006) (Correct)
Active bibliography (related documents): More All
0.5: LAO*: A heuristic search algorithm that finds solutions with.. - Hansen, Zilberstein (2001) (Correct)
0.3: A Heuristic Search Algorithm for Markov Decision Problems - Hansen, Zilberstein (Correct)
0.2: Search Heuristics for Box Decomposition Methods - Ratschan (2003) (Correct)
Similar documents based on text: More All
0.8: Models For Dependable Computation with Multiple Inputs and Some.. - Wang, al. (2000) (Correct)
0.8: Use Approximation Hardness to Achieve Dependable Computation - Burmester, Desmedt, Wang (1998) (Correct)
0.7: Efficient Zero-Knowledge Proofs for Some Practical Graph Problems - Desmedt, Wang (Correct)
Related documents from co-citation: More All
2: World Wide Web: Internet and Web Inform (context) - Papazoglou - 2003
2: Computationally related problems (context) - Sahni - 1974
2: Information sharing across private databases - Agrawal, Evfimievski et al. - 2003
BibTeX entry: (Update)
@misc{ desmedt-maximum,
author = "Yvo Desmedt and Yongge Wang",
title = "Maximum Flows and Critical Vertices in AND/OR Graphs",
url = "citeseer.ist.psu.edu/593376.html" }
Citations (may not include all citations):4212 Computers and Intractability: A Guide to the Theory of NP-Co.. (context) - Garey, Johnson - 1979
451 Prentice-Hall (context) - Bertsekas, Gallager - 1992
410 Principles of Artificial Intelligence (context) - Nilsson - 1980
303 Princeton University Press (context) - Ford, Fulkerson et al. - 1962
266 Heuristics: Intelligent Search Strategies for Computer Probl.. (context) - Pearl - 1984
209 Computer Science Press (context) - Even - 1979
94 Graphs and Algorithms (context) - Gondran, Minoux - 1984
69 The polynomial time hierarchy (context) - Stockmeyer - 1977
32 Computationally related problems (context) - Sahni - 1974
12 and Algorithms (context) - Swamy, Thulasiraman et al. - 1981
10 admissible and optimal algorithm searching ANDOR graph (context) - Slagle, optimal et al. - 1971
8 Optimizing decision trees through heuristically guided searc.. (context) - Martelli, Montanari - 1978
5 Additive ANDOR graph (context) - Montanari, OR et al. - 1973
5 Using approximation hardness to achieve dependable computati.. (context) - Burmester, Desmedt et al. - 1998
4 ANDOR graph heuristic search method (context) - Bagchi, heuristic et al. - 1985
4 when heuristics overestimate (context) - Chakrabarti, Ghose et al. - 1988
1 Best first search algorithm ANDOR graph with cycle (context) - first, in et al. - 1996
1 Admissible heuristic search ANDOR graph (context) - Mahanti, search et al. - 1983
1 NP-Hardness of dependable computation with multiple inputs (context) - Wang, Desmedt et al.
Documents on the same site (http://cs.uwm.edu/~wang/): More
Genericity, Randomness, And Polynomial-Time Approximations - Wang (1998) (Correct)
Resource-Bounded Balanced Genericity, Stochasticity .. - Ambos-Spies.. (Correct)
The Law of the Iterated Logarithm for p-Random Sequences - Wang (1996) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC