Sciweavers

18 search results - page 1 / 4
» Using Local Search to Speed Up Filtering Algorithms for Some...
Sort
View
CPAIOR
2008
Springer
13 years 6 months ago
Using Local Search to Speed Up Filtering Algorithms for Some NP-Hard Constraints
Abstract. This paper proposes to use local search inside filtering algorithms of combinatorial structures for which achieving a desired level of consistency is too computationally ...
Philippe Galinier, Alain Hertz, Sandrine Paroz, Gi...
CIRA
2007
IEEE
274views Robotics» more  CIRA 2007»
13 years 11 months ago
Adaptive Object Tracking using Particle Swarm Optimization
—This paper presents an automatic object detection and tracking algorithm by using particle swarm optimization (PSO) based method, which is a searching algorithm inspired by the ...
Yuhua Zheng, Yan Meng
ICDE
2008
IEEE
214views Database» more  ICDE 2008»
14 years 5 months ago
Efficient Online Subsequence Searching in Data Streams under Dynamic Time Warping Distance
Abstract- Data streams of real numbers are generated naturally in many applications. The technology of online subsequence searching in data streams becomes more and more important ...
Mi Zhou, Man Hon Wong
JDA
2008
87views more  JDA 2008»
13 years 4 months ago
Lossless filter for multiple repetitions with Hamming distance
Similarity search in texts, notably in biological sequences, has received substantial attention in the last few years. Numerous filtration and indexing techniques have been create...
Pierre Peterlongo, Nadia Pisanti, Fréd&eacu...
CPAIOR
2005
Springer
13 years 10 months ago
Computing Explanations for the Unary Resource Constraint
Integration of explanations into a CSP solver is a technique addressing difficult question “why my problem has no solution”. Moreover, explanations together with advanced searc...
Petr Vilím