Sciweavers

1055 search results - page 15 / 211
» Enumerations in computable structure theory
Sort
View
ATAL
2005
Springer
15 years 3 months ago
Protocol synthesis with dialogue structure theory
Inspired by computational linguistic approaches to annotate the structures that occur in human dialogue, this paper describes a technique which encodes these structures as transfo...
Jarred McGinnis, David Robertson, Christopher Walt...
FPGA
2006
ACM
155views FPGA» more  FPGA 2006»
15 years 1 months ago
Improvements to technology mapping for LUT-based FPGAs
The paper presents several improvements to state-of-theart in FPGA technology mapping exemplified by a recent advanced technology mapper DAOmap [Chen and Cong, ICCAD `04]. Improve...
Alan Mishchenko, Satrajit Chatterjee, Robert K. Br...
STACS
2001
Springer
15 years 2 months ago
Randomness, Computability, and Density
We study effectively given positive reals (more specifically, computably enumerable reals) under a measure of relative randomness introduced by Solovay [32] and studied by Calud...
Rodney G. Downey, Denis R. Hirschfeldt, Andr&eacut...
NSPW
2004
ACM
15 years 3 months ago
A qualitative framework for Shannon information theories
This paper presents a new paradigm for information theory which is a synthesis of Barwise-Seligman’s qualitative theory and Shannon’s quantitative theory. The new paradigm is ...
Gerard Allwein
AAAI
1993
14 years 11 months ago
Finding Accurate Frontiers: A Knowledge-Intensive Approach to Relational Learning
learning (EBL) component. In this paper we provide a brief review of FOIL and FOCL, then discuss how operationalizing a domain theory can adversely affect the accuracy of a learned...
Michael J. Pazzani, Clifford Brunk