Sciweavers

747 search results - page 21 / 150
» Theory and Construction of Molecular Computers
Sort
View
JSC
2006
122views more  JSC 2006»
13 years 8 months ago
An automated prover for Zermelo-Fraenkel set theory in Theorema
This paper presents some fundamental aspects of the design and the implementation of an automated prover for Zermelo-Fraenkel set theory within the well-known Theorema system. The...
Wolfgang Windsteiger
FOCM
2007
54views more  FOCM 2007»
13 years 8 months ago
Smooth and Algebraic Invariants of a Group Action: Local and Global Constructions
We provide an algebraic formulation of the moving frame method for constructing local smooth invariants on a manifold under an action of a Lie group. This formulation gives rise t...
Evelyne Hubert, Irina A. Kogan
CIE
2007
Springer
14 years 2 months ago
Quotients over Minimal Type Theory
Abstract. We consider an extensional version, called qmTT, of the intensional Minimal Type Theory mTT, introduced in a previous paper with G. Sambin, enriched with proof-irrelevanc...
Maria Emilia Maietti
BIRTHDAY
2009
Springer
14 years 1 months ago
Pervasive Theory of Memory
For many aspects of memory theoretical treatment already exists, in particular for: simple cache construction, store buers and store buer forwarding, cache coherence protocols, o...
Ulan Degenbaev, Wolfgang J. Paul, Norbert Schirmer
COMPGEOM
2003
ACM
14 years 1 months ago
Incremental constructions con BRIO
Randomized incremental constructions are widely used in computational geometry, but they perform very badly on large data because of their inherently random memory access patterns...
Nina Amenta, Sunghee Choi, Günter Rote