Sciweavers

8086 search results - page 231 / 1618
» On the Implementation of Dynamic Patterns
Sort
View
ALMOB
2006
80views more  ALMOB 2006»
15 years 6 months ago
Effective p-value computations using Finite Markov Chain Imbedding (FMCI): application to local score and to pattern statistics
The technique of Finite Markov Chain Imbedding (FMCI) is a classical approach to complex combinatorial problems related to sequences. In order to get efficient algorithms, it is k...
Grégory Nuel
INFORMATICALT
2006
108views more  INFORMATICALT 2006»
15 years 6 months ago
Experiments with Hybrid Genetic Algorithm for the Grey Pattern Problem
Recently, genetic algorithms (GAs) and their hybrids have achieved great success in solving difficult combinatorial optimization problems. In this paper, the issues related to the ...
Alfonsas Misevicius
NN
2008
Springer
163views Neural Networks» more  NN 2008»
15 years 6 months ago
Central pattern generators for locomotion control in animals and robots: A review
The problem of controlling locomotion is an area in which neuroscience and robotics can fruitfully interact. In this article, I will review research carried out on locomotor centr...
Auke Jan Ijspeert
TCSV
2008
124views more  TCSV 2008»
15 years 6 months ago
A Block-Edge-Pattern-Based Content Descriptor in DCT Domain
In this correspondence, we describe a robust and effective content descriptor based on block edge patterns extracted directly in DCT domain, which is suitable for applications in J...
Jianmin Jiang, Kaijin Qiu, Guoqiang Xiao
JAIR
2007
107views more  JAIR 2007»
15 years 6 months ago
Compressed Pattern Databases
A pattern database (PDB) is a heuristic function implemented as a lookup table that stores the lengths of optimal solutions for subproblem instances. Standard PDBs have a distinct...
Ariel Felner, Richard E. Korf, Ram Meshulam, Rober...