1055 search results - page 18 / 211 » Enumerations in computable structure theory |
Lecture Notes
These lecture notes cover several topics such as Abstract Preferences and Choices, A Choice Structure Approach to Consumer Demand, A Preference Based Approach to Consumer Demand
P...
DCC
2001
IEEE
14 years 8 months ago
2001
IEEE
A method for demonstrating and enumerating uniformly efficient (permutation-optimal) trellis decoders for self-dual codes of high minimum distance is developed. Such decoders and c...
AML
2011
13 years 4 months ago
2011
The notion of superhigh computably enumerable (c.e.) degrees was first introduced by Mohrherr in [7], where she proved the existence of incomplete superhigh c.e. degrees, and high...
EUROCAST
2005
Springer
14 years 2 months ago
2005
Springer
In this paper a way to have structures with partiality in its internal structure in a categorical approach is presented and, with this, a category of partial graphs Grp is given an...
ACTA
2005
13 years 9 months ago
2005
A hybrid network of evolutionary processors (an HNEP) consists of several language processors which are located in the nodes of a virtual graph and able to perform only one type o...