11160 search results - page 105 / 2232 » Incompleteness in a General Setting |
IPPS
2000
IEEE
14 years 3 months ago
2000
IEEE
1 The problem of sorting an intransitive total ordered set, a generalization of regular sorting, is considered. This generalized sorting is based on the fact that there exists a s...
DCG
2006
13 years 11 months ago
2006
We use circular sequences to give an improved lower bound on the minimum number of ( k)
IJCSS
2000
13 years 11 months ago
2000
Abstract. The quality of a decision tree is usually evaluated through its complexity and its generalization accuracy. Tree-simpli
LATIN
2004
Springer
14 years 4 months ago
2004
Springer
In a preceding paper [6], automata have been introduced for words indexed by linear orderings. These automata are a generalization of automata for finite, infinite, bi-infinite...
STACS
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. Traditionally a tiling is defined with a finite number of finite forbidden patterns. We can generalize this notion considering any set of patterns. Generalized tilings...