| Alternate document: Details Real-time Feasibility of Nonlinear Predictive Control for Large Scale Processes a Case Study (00) Z. Nagy, R. Findeisen, M. Diehl, |
(Enter summary)
Abstract: Tree contraction is a powerful technique for solving a large number of graph problems
on families of recursively definable graphs. The method is based on processing the
parse tree associated with a member of such a family of graphs in a bottom-up fashion,
such that the solution to the problem is obtained at the root of the tree. Sequentially,
this can be done in linear time with respect to the size of the input graph. In parallel,
efficient and even cost optimal tree contraction algorithms ... (Update)
Context of citations to this paper: More
.... of superunitary behavior with respect to the quality of the solution computed by parallel machines to real time problems [1, 2, 3, 4, 5, 8, 9, 10]. This paper focuses on real time paradigms that resort to the nearest neighbor method in order to compute the desired result....
...to achieve the same results (with respect to speed and quality) is without meaning in this context. Similar results appear in [7, 8, 9, 17]. The various computational paradigms described in this paper can be modified in several different ways. For example, to cite only...
Cited by: More
An Algorithmic Model for Real Time Computation - Akl (2002)
(Correct)
Discrete Steepest Descent In Real Time - Akl (2001)
(Correct)
Superlinear Performance In Real-Time Parallel Computation - Akl (2001)
(Correct)
Active bibliography (related documents): More All
0.5: Parallel Real-Time Computation: Sometimes Quantity Means Quality - Akl (2000)
(Correct)
0.5: Nonlinearity, Maximization, and Parallel Real-Time Computation - Akl (2000)
(Correct)
0.5: Locating The Median Of A Tree In Real Time - Nagy, Akl (2001)
(Correct)
Similar documents based on text: More All
0.3: Parallel Tree Contraction' - Part Fundamentals Gary
(Correct)
0.3: Society for Industrial and Applied Mathematics - Parallel Tree Contraction
(Correct)
0.2: Computing Nearest Neighbors In Real Time - Nagy, Akl (2001)
(Correct)
Related documents from co-citation: More All
6: Parallel real-time optimization: Beyond speedup
- Akl, Bruda - 1999
5: Parallel real-time computation: Sometimes quantity means quality
- Akl - 2000
5: A case study in real-time parallel computation: Correcting algorithms
- Bruda, Akl - 1998
BibTeX entry: (Update)
M. Nagy and S. G. Akl. Real-time minimum vertex cover for two-terminal series-parallel graphs. Technical Report No. 2000-441, Department of Computing and Information Science, Queen's University, Kingston, Ontario, 2000. 18 pages. http://citeseer.ist.psu.edu/nagy00realtime.html More
@misc{ nagy00realtime,
author = "M. Nagy and S. Akl",
title = "Real-time minimum vertex cover for two-terminal series-parallel graphs",
text = "M. Nagy and S. G. Akl. Real-time minimum vertex cover for two-terminal
series-parallel graphs. Technical Report No. 2000-441, Department of Computing
and Information Science, Queen's University, Kingston, Ontario, 2000. 18
pages.",
year = "2000",
url = "citeseer.ist.psu.edu/nagy00realtime.html" }
Citations (may not include all citations):
4212
Computers and Intractability: A Guide to the Theory of NP-Co.. (context) - Garey, Johnson - 1979
122
Parallel Tree Contraction and its Applications (context) - Miller, Reif - 1985
74
The recognition of series parallel digraphs (context) - Valdes, Tarjan et al. - 1982
44
Online computation
- Irani, Karlin - 1997
44
Optimal parallel evaluation of tree-structured computation b.. (context) - Kosaraju, Delcher - 1988
32
Optimal tree contraction in an EREW model (context) - Gazit, Miller et al. - 1987
28
Linear-time computability of combinatorial problems on serie.. (context) - Takamizawa, Nishizeki et al. - 1982
28
Parallel Computation: Models and Methods (context) - Akl - 1997
22
Parallel Processing in Industrial Real-Time Applications (context) - Lawson - 1992
18
Parallel real-time optimization: beyond speedup
- Akl, Bruda - 1999
14
A case study in real-time parallel computation: Correcting a..
- Bruda, Akl
13
Real-Time Database and Information Systems (context) - Bestavros, Fay-Wolfe - 1997
12
Parallel recognition and decomposition of two terminal serie.. (context) - He, Yesha - 1987
11
Real-Time Transaction Processing (context) - Thorin - 1992
10
Parallel real-time numerical computation: Beyond speedup III
- Akl, Bruda - 2000
8
Parallel real-time cryptography: Beyond speedup II
- Akl, Bruda - 2000
6
Efficient Parallel Algorithms for Series Parallel Graphs (context) - He - 1991
6
A Simple Tree Contraction Algorithm (context) - Abrahamson, Dadoun et al. - 1989
5
A methodology for constructing linear graph algorithms (context) - Wimer, Hedetniemi et al. - 1985
5
Efficient parallel algorithms for solving some tree problems (context) - He - 1986
3
An optimal parallel matching algorithm for cographs
- Lin, Olariu - 1994
2
Tree-Based Parallel Algorithm Design (context) - Miller, Teng - 1997
1
An Efficient Parallel Algorithm for Maximum Matching (context) - Parfenoff - 1998
1
Nonlinearity, maximization, and parallel real-time computati..
- Akl - 2000
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.qucis.queensu.ca/Parallel/technical.html): More
Parallel Real-Time Cryptography: Beyond Speedup II - Akl, Bruda (1999)
(Correct)
Parallel Real-Time Numerical Computation: Beyond Speedup III - Akl, Bruda
(Correct)
On the Power of Real-Time Turing Machines: k Tapes Are More.. - Bruda, Akl (1999)
(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