3378 search results - page 259 / 676 » A universe of binding and computation |
181
click to vote
SODA
2000
ACM
15 years 8 months ago
2000
ACM
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...
170
click to vote
TREC
2000
15 years 8 months ago
2000
This paper describes the architecture, operation and results obtained with the Question Answering prototype developed in the Department of Language Processing and Information Syst...
175
click to vote
AML
2008
15 years 6 months ago
2008
We compare realizability models over partial combinatory algebras by embedding them into sheaf toposes. We then use the machinery of Grothendieck toposes and geometric morphisms t...
164
click to vote
CI
2004
15 years 6 months ago
2004
Although ceteris paribus preference statements concisely represent one natural class of preferences over outcomes or goals, many applications of such preferences require numeric u...
186
click to vote
CORR
2004
Springer
15 years 6 months ago
2004
Springer
: The Game of Life cellular automaton is a classical example of a massively parallel collision-based computing device. The automaton exhibits mobile patterns, gliders, and generato...