Sciweavers

747 search results - page 19 / 150
» Theory and Construction of Molecular Computers
Sort
View
JUCS
2010
95views more  JUCS 2010»
13 years 3 months ago
Realisability for Induction and Coinduction with Applications to Constructive Analysis
Abstract: We prove the correctness of a formalised realisability interpretation of extensions of first-order theories by inductive and coinductive definitions in an untyped -calcul...
Ulrich Berger
DAGSTUHL
2006
13 years 10 months ago
A convenient category of domains
We motivate and define a category of topological domains, whose objects are certain topological spaces, generalising the usual -continuous dcppos of domain theory. Our category su...
Ingo Battenfeld, Matthias Schröder, Alex Simp...
SPAA
1998
ACM
14 years 26 days ago
Computation-Centric Memory Models
We present a computation-centric theory of memory models. Unlike traditional processor-centric models, computation-centric models focus on the logical dependencies among instructi...
Matteo Frigo, Victor Luchangco
DIS
2008
Springer
13 years 10 months ago
Constructing Iceberg Lattices from Frequent Closures Using Generators
Frequent closures (FCIs) and generators (FGs) as well as the precedence relation on FCIs are key components in the definition of a variety of association rule bases. Although their...
Laszlo Szathmary, Petko Valtchev, Amedeo Napoli, R...
ICNP
2002
IEEE
14 years 1 months ago
A Theory of Window-Based Unicast Congestion Control
This work presents a comprehensive theoretical framework for window-based congestion control protocols that are designed to converge to fairness and efficiency. We first derive ...
Nishanth R. Sastry, Simon S. Lam