5964 search results - page 388 / 1193 » A theory of speculative computation |
231
click to vote
TLCA
2007
Springer
16 years 1 months ago
2007
Springer
A Kripke Semantics is defined for a higher-order logic programming language with constraints, based on Church’s Theory of Types and a generic constraint formalism. Our syntactic...
259
click to vote
COMPGEOM
2006
ACM
16 years 1 months ago
2006
ACM
A triangulation of a planar point set S is a maximal plane straight-line graph with vertex set S. In the minimum weight triangulation (MWT) problem, we are looking for a triangula...
176
click to vote
SIGECOM
2005
ACM
16 years 1 months ago
2005
ACM
We determine the communication complexity of the common voting rules. The rules (sorted by their communication complexity from low to high) are plurality, plurality with runoff, ...
167
Voted
BIRTHDAY
2005
Springer
16 years 1 months ago
2005
Springer
Abstract. Variables make rule-based systems more abstract and expressive, as witnessed by term rewriting systems and two-level grammars. In this paper we show that variables can be...
170
click to vote
CCA
2005
Springer
16 years 1 months ago
2005
Springer
In the Type-2 Theory of Effectivity, one considers representations of topological spaces in which infinite words are used as “names” for the elements they represent. Given s...