Sciweavers

1220 search results - page 223 / 244
» Restricting grammatical complexity
Sort
View
IFL
2005
Springer
207views Formal Methods» more  IFL 2005»
14 years 1 months ago
A Dependently Typed Framework for Static Analysis of Program Execution Costs
Abstract. This paper considers the use of dependent types to capture information about dynamic resource usage in a static type system. Dependent types allow us to give (explicit) p...
Edwin Brady, Kevin Hammond
ISSADS
2005
Springer
14 years 1 months ago
Database System Architecture - A Walk Through Time: From Centralized Platform to Mobile Computing - Keynote Address
Classical distributed database systems monolithically offer distribution transparency and higher performance. This is made possible by making data available and closer to the appl...
Ali R. Hurson, Yu Jiao
STACS
2005
Springer
14 years 1 months ago
Kolmogorov-Loveland Randomness and Stochasticity
An infinite binary sequence X is Kolmogorov-Loveland (or KL) random if there is no computable non-monotonic betting strategy that succeeds on X in the sense of having an unbounde...
Wolfgang Merkle, Joseph S. Miller, André Ni...
SIGMETRICS
2004
ACM
124views Hardware» more  SIGMETRICS 2004»
14 years 1 months ago
Interposed proportional sharing for a storage service utility
This paper develops and evaluates new share-based scheduling algorithms for differentiated service quality in network services, such as network storage servers. This form of resou...
Wei Jin, Jeffrey S. Chase, Jasleen Kaur
KR
2004
Springer
14 years 28 days ago
On Eliminating Disjunctions in Stable Logic Programming
Disjunction is generally considered to add expressive power to logic programs under the stable model semantics, which have become a popular programming paradigm for knowledge repr...
Thomas Eiter, Michael Fink, Hans Tompits, Stefan W...