1055 search results - page 10 / 211 » Enumerations in computable structure theory |
WCC
2005
Springer
14 years 1 months ago
2005
Springer
In this paper, we describe a broad class of problems arising in the context of designing codes for DNA computing. We primarily focus on design considerations pertaining to the phen...
JCB
2008
13 years 7 months ago
2008
In this paper, we study k-noncrossing, -canonical RNA pseudoknot structures with minimum arc-length greater or equal to four. Let T OE4 k; .n/ denote the number of these structure...
SIGECOM
2005
ACM
14 years 1 months ago
2005
ACM
We present the first design for a fully expressive iterative combinatorial exchange (ICE). The exchange incorporates a tree-based bidding language that is concise and expressive ...
JSYML
2007
13 years 7 months ago
2007
In this paper we answer the following well-known open question in computable model theory. Does there exist a computable not ℵ0-categorical saturated structure with a unique com...
INFORMS
2010
13 years 6 months ago
2010
The concept of dominance among nodes of a branch-decision tree, although known since a long time, is not exploited by general-purpose Mixed-Integer Linear Programming (MILP) enume...