1055 search results - page 66 / 211 » Enumerations in computable structure theory |
COLING
1992
14 years 11 months ago
1992
An arbitrary definite clause grammar can be transforaled into a so-called Generalized Greibach Normal Form (GGNF), a generalization of the classical Greibach Normat Form (GNF) for...
JAIR
2008
14 years 9 months ago
2008
We present the design and analysis of the first fully expressive, iterative combinatorial exchange (ICE). The exchange incorporates a tree-based bidding language (TBBL) that is co...
TSP
2008
14 years 9 months ago
2008
Abstract--This paper presents a new approach to soft demodulation for MIMO channels. The proposed method is an approximation to the exact a posteriori probability-per-bit computer....
CHI
2006
ACM
15 years 10 months ago
2006
ACM
icians or philosophers use abstract symbols to derive formulas or form proofs. Indeed, these sketches are structural geometric proofs, consistent with Plato's supposition that...
EH
2005
IEEE
15 years 3 months ago
2005
IEEE
This paper proposes an original approach to the reliability analysis for Embryonics [4], by introducing the accuracy threshold measure, borrowed from fault-tolerant quantum comput...