15033 search results - page 2768 / 3007 » Complexity Theory and Algorithms |
114
Voted
PDPTA
2004
15 years 6 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...
139
click to vote
ICAI
2003
15 years 6 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...
168
click to vote
PRIS
2004
15 years 6 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...
152
click to vote
ICMLA
2003
15 years 6 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...
144
Voted
IJCAI
2003
15 years 6 months ago
2003
We examine the approach of encoding planning problems as CSPs more closely. First we present a simple CSP encoding for planning problems and then a set of transformations that can...