Sciweavers

8838 search results - page 293 / 1768
» Generalizing Domain Theory
Sort
View
ICFP
2005
ACM
16 years 6 months ago
A computational approach to reflective meta-reasoning about languages with bindings
We present a foundation for a computational meta-theory of languages with bindings implemented in a computer-aided formal reasoning environment. Our theory provides the ability to...
Aleksey Nogin, Alexei Kopylov, Xin Yu, Jason Hicke...
ARITH
1999
IEEE
15 years 11 months ago
Necessary and Sufficient Conditions for Parallel, Constant Time Conversion and Addition
This note presents necessary and sufficient conditions for parallel and constant time conversions from one digit-set into another, and thus also for constant time addition. In the...
Peter Kornerup
EMNLP
2008
15 years 8 months ago
Summarizing Spoken and Written Conversations
In this paper we describe research on summarizing conversations in the meetings and emails domains. We introduce a conversation summarization system that works in multiple domains...
Gabriel Murray, Giuseppe Carenini
SIGECOM
2006
ACM
107views ECommerce» more  SIGECOM 2006»
16 years 19 days 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
UAI
1998
15 years 8 months ago
Axiomatizing Causal Reasoning
Causal models defined in terms of a collection of equations, as defined by Pearl, are axiomatized here. Axiomatizations are provided for three successively more general classes of...
Joseph Y. Halpern