Sciweavers

1127 search results - page 28 / 226
» Theory Extension in ACL2(r)
Sort
View
107
Voted
ENTCS
2011
131views more  ENTCS 2011»
14 years 7 months ago
Computational Complexity in Non-Turing Models of Computation: The What, the Why and the How
We preliminarily recap what is meant by complexity and non-Turing computation, by way of explanation of our title, ‘Computational Complexity in Non-Turing Models of Computationâ...
Ed Blakey
ESOP
2008
Springer
15 years 2 months ago
A Realizability Model for Impredicative Hoare Type Theory
We present a denotational model of impredicative Hoare Type Theory, a very expressive dependent type theory in which one can and reason about mutable abstract data types. The model...
Rasmus Lerchedahl Petersen, Lars Birkedal, Aleksan...
COSIT
2007
Springer
120views GIS» more  COSIT 2007»
15 years 6 months ago
Relations in Mathematical Morphology with Applications to Graphs and Rough Sets
Rough sets have been applied in spatial information theory to construct theories of granularity – presenting information at different levels of detail. Mathematical morphology c...
John G. Stell
SIGECOM
2006
ACM
107views ECommerce» more  SIGECOM 2006»
15 years 6 months ago
Networks preserving evolutionary equilibria and the power of randomization
We study a natural extension of classical evolutionary game theory to a setting in which pairwise interactions are restricted to the edges of an undirected graph or network. We ge...
Michael S. Kearns, Siddharth Suri
ISPDC
2005
IEEE
15 years 6 months ago
A Strategyproof Mechanism for Scheduling Divisible Loads in Distributed Systems
An important scheduling problem is the one in which there are no dependencies between tasks and the tasks can be of arbitrary size. This is known as the divisible load scheduling ...
Daniel Grosu, Thomas E. Carroll