10988 search results - page 1934 / 2198 » Algorithmic Folding Complexity |
175
click to vote
IJCAI
2001
15 years 5 months ago
2001
Supervised and unsupervised learning methods have traditionally focused on data consisting of independent instances of a single type. However, many real-world domains are best des...
107
click to vote
PDPTA
2004
15 years 5 months ago
2004
We present the MBRAM model for static evaluation of the performance of memory-bound programs. The MBRAM model predicts the actual running time of a memory-bound program directly fr...
130
click to vote
ICAI
2003
15 years 5 months ago
2003
Boolean satisfiability (SAT) is the canonical NP-complete problem that plays an important role in AI and has many practical applications in Computer Science in general. Boolean n...
154
click to vote
PRIS
2004
15 years 5 months ago
2004
Similarity search in time series databases is an important research direction. Several methods have been proposed in order to provide algorithms for efficient query processing in t...
140
click to vote
ICMLA
2003
15 years 5 months ago
2003
— This paper shows that the distributed representation found in Learning Vector Quantization (LVQ) enables reinforcement learning methods to cope with a large decision search spa...