1096 search results - page 1 / 220 » A New Approach for Speeding Up Enumeration Algorithms |
COCOON
1999
Springer
14 years 3 months ago
1999
Springer
Abstract: We propose a new approach for speeding up enumeration algorithms. The approach does not rely on data structures deeply, instead utilizes analysis of computation time. It ...
ISAAC
1998
Springer
14 years 3 months ago
1998
Springer
SBIA
2004
Springer
14 years 4 months ago
2004
Springer
This work presents a new algorithm, called Heuristically Accelerated Q–Learning (HAQL), that allows the use of heuristics to speed up the well-known Reinforcement Learning algori...
COMGEO
2004
ACM
13 years 10 months ago
2004
ACM
We present a new incremental algorithm for constructing the union of n triangles in the plane. In our experiments, the new algorithm, which we call the Disjoint-Cover (DC) algorit...
CPM
2007
Springer
14 years 5 months ago
2007
Springer
We present a method to speed up the dynamic program algorithms used for solving the HMM decoding and training problems for discrete time-independent HMMs. We discuss the applicatio...