Sciweavers

1199 search results - page 13 / 240
» How to Compare the Power of Computational Models
Sort
View
BIRTHDAY
2008
Springer
15 years 1 months ago
Tree Automata over Infinite Alphabets
A number of models of computation on trees labeled with symbols from an infinite alphabet is considered. We study closure and decision properties of each of the models and compare ...
Michael Kaminski, Tony Tan
86
Voted
VLDB
1991
ACM
111views Database» more  VLDB 1991»
15 years 3 months ago
The Power of Methods With Parallel Semantics
A model capturing the data manipulation capabilities of a large class of methods in ohjectoriented databases is proposed and investsigated. The model uses a deterministic, paralle...
Karl Denninghoff, Victor Vianu
97
Voted
ZUM
2000
Springer
15 years 3 months ago
A Computation Model for Z Based on Concurrent Constraint Resolution
We present a computation model for Z, which is based on a reduction to a small calculus, called Z, and on concurrent constraint resolution techniques applied for computing in thi...
Wolfgang Grieskamp
CORR
2010
Springer
98views Education» more  CORR 2010»
14 years 11 months ago
Extended Computation Tree Logic
We introduce a generic extension of the popular branching-time logic CTL which refines the temporal until and release operators with formal languages. For instance, a language may ...
Roland Axelsson, Matthew Hague, Stephan Kreutzer, ...
EUC
2006
Springer
15 years 3 months ago
Co-optimization of Performance and Power in a Superscalar Processor Design
Abstract. As process technology scales down, power wall starts to hinder improvements in processor performance. Performance optimization has to proceed under a power constraint. Th...
Yongxin Zhu, Weng-Fai Wong, Stefan Andrei