6142 search results - page 1153 / 1229 » The Complexity of Partition Functions |
117
click to vote
STACS
2005
Springer
15 years 9 months ago
2005
Springer
An infinite binary sequence X is Kolmogorov-Loveland (or KL) random if there is no computable non-monotonic betting strategy that succeeds on X in the sense of having an unbounde...
137
Voted
TABLEAUX
2005
Springer
15 years 9 months ago
2005
Springer
This paper describes the implementation of a tableau-based reasoning component which is capable of providing quasi natural language explanations for subsumptions within ALEHFR+ TBo...
150
Voted
VLDB
2005
ACM
15 years 9 months ago
2005
ACM
Many enterprise applications prefer to store XML data as a rich data type, i.e. a sequence of bytes, in a relational database system to avoid the complexity of decomposing the dat...
128
click to vote
XPU
2005
Springer
15 years 9 months ago
2005
Springer
The main goal to be answered by this Ph.D. thesis is whether there is a potential for a successful and powerful application of agile methods and related techniques to embedded syst...
118
click to vote
CASES
2004
ACM
15 years 9 months ago
2004
ACM
Abstract— In a direct-mapped instruction cache, all instructions that have the same memory address modulo the cache size, share a common and unique cache slot. Instruction cache ...