12265 search results - page 268 / 2453 » Knuth-Morris-Pratt Algorithm: An Analysis |
169
click to vote
IBPRIA
2005
Springer
16 years 4 days ago
2005
Springer
Abstract. Two extensions of the original Wilson’s editing method are introduced in this paper. These new algorithms are based on estimating probabilities from the k-nearest neigh...
177
click to vote
GECCO
2004
Springer
16 years 1 hour ago
2004
Springer
Randomized search heuristics, among them randomized local search and evolutionary algorithms, are applied to problems whose structure is not well understood, as well as to problems...
164
click to vote
GECCO
2004
Springer
16 years 1 hour ago
2004
Springer
Generating manipulator trajectories considering multiple objectives and obstacle avoidance is a non trivial optimization problem. In this paper a multiobjective genetic algorithm i...
154
click to vote
ASAP
1997
IEEE
15 years 10 months ago
1997
IEEE
This paper presents how to find optimized buffer size for VLSI architectures of full-search block matching algorithms. Starting from the DG (dependency graph) analysis, we focus i...
143
Voted
CG
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. A one-player, finite, probabilistic game with perfect information can be presented as a bipartite graph. For one-player Can't Stop, the graph is cyclic and the chall...