| |
Browse All Reviews > Theory Of Computation (F) > Computation By Abstract Devices (F.1) > Models Of Computation (F.1.1) > Relations Between Models (F.1.1...)
|
|
 |
|
|
| |
|
|
| |
1-6 of 6
Reviews about "Relations Between Models (F.1.1...)":
|
Date Reviewed |
| |
Relationships between probabilistic Boolean networks and dynamic Bayesian networks as models of gene regulatory networks
Lähdesmäki H., Hautaniemi S., Shmulevich I., Yli-Harja O. Signal Processing 86(4): 814-834, 2006. Type: Article
Probabilistic Boolean networks (PBNs) and dynamic Bayesian networks (DBNs) are two state-of-the-art model classes for representing genetic network modeling. Investigating relationships between the models (more accurately, expressing a ...
|
Aug 25 2006 |
| |
Developing a meta model for the Bunge---Wand---Weber ontological constructs
Rosemann M., Green P. Information Systems 27(2): 75-91, 2002. Type: Article
Rosemann and Green consider some ontological constructs defined by Bunge, and made more specific in the context of information systems by Wand and Weber. These constructs provide a semantically clear and solid foundation for understand...
|
Nov 19 2003 |
| |
Tree transducers with external functions
Fülöp Z., Herrmann F., Vágvölgyi S., Vogler H. Theoretical Computer Science 108(2): 185-236, 1993. Type: Article
Several theorems about the relationships between several classes of tree transducers (tree-based rewriting systems) are presented and proven. The authors’ primary interest is in tree transducers that use a class of external f...
|
Oct 1 1994 |
| |
Optimal dynamic embedding of X-trees into arrays
Hodel A., Loui M. Theoretical Computer Science 59(3): 259-276, 1988. Type: Article
This paper presents a dynamic embedding of the contents of a storage medium organized as an X-tree into a storage medium organized as a d-dimensional array. An X-tree machine is simulated by a d-dimensional array machine....
|
Jul 1 1990 |
| |
Fast algorithms for N-dimensional restrictions of hard problems
Meyer auf der Heide F. Journal of the ACM 35(3): 740-747, 1988. Type: Article
This paper adduces evidence of the power of linear search algorithms (LSAs) by showing that some LSAs can quickly recognize parallel random access machine (PRAM) languages. More precisely, let M be a PRAM with...
|
Apr 1 1989 |
| |
Computation: computability, similarity and duality
Jia-Wei H., John Wiley & Sons, Inc., New York, NY, 1986. Type: Book (9780470203873)
This monograph presents an original view of computational models and complexity measures for parallel computation. The main topic is what the author calls the principle of similarity. Basically, the author shows that most deterministic...
|
Mar 1 1988 |
| |
|
|
| |
|
|
