Sciweavers

220 search results - page 6 / 44
» Saturated models of universal theories
Sort
View
PROCEDIA
2010
97views more  PROCEDIA 2010»
13 years 5 months ago
Ontological musings on how nature computes
Modern physical theory and modern computational techniques are used to provide conjecture on how nature computes. I utilize time-domain simulation of physical phenomena and build ...
J. F. Nystrom
FOSSACS
2011
Springer
12 years 10 months ago
Irrelevance in Type Theory with a Heterogeneous Equality Judgement
Dependently typed programs contain an excessive amount of static terms which are necessary to please the type checker but irrelevant for computation. To obtain reasonable performan...
Andreas Abel
ICDT
2012
ACM
251views Database» more  ICDT 2012»
11 years 9 months ago
Computing universal models under guarded TGDs
A universal model of a database D and a set Σ of integrity constraints is a database that extends D, satisfies Σ, and is most general in the sense that it contains sound and co...
André Hernich
SODA
2000
ACM
95views Algorithms» more  SODA 2000»
13 years 8 months ago
Towards a theory of cache-efficient algorithms
We present a model that enables us to analyze the running time of an algorithm on a computer with a memory hierarchy with limited associativity, in terms of various cache parameter...
Sandeep Sen, Siddhartha Chatterjee
ACRI
2006
Springer
14 years 1 months ago
Modeling Crowd Behavior Based on Social Comparison Theory: Extended Abstract
on Theory: Extended Abstract Natalie Fridman and Gal Kaminka Bar Ilan University, Israel The MAVERICK Group Computer Science Department {fridman,galk}cs.biu.ac.il Abstract. Modelin...
Natalie Fridman, Gal A. Kaminka