Sciweavers

151 search results - page 4 / 31
» A CSP Search Algorithm with Reduced Branching Factor
Sort
View
ACSC
2006
IEEE
15 years 3 months ago
Improvements of TLAESA nearest neighbour search algorithm and extension to approximation search
Nearest neighbour (NN) searches and k nearest neighbour (k-NN) searches are widely used in pattern recognition and image retrieval. An NN (k-NN) search finds the closest object (...
Ken Tokoro, Kazuaki Yamaguchi, Sumio Masuda
IWANN
2007
Springer
15 years 3 months ago
Speeding Up the Dissimilarity Self-Organizing Maps by Branch and Bound
Abstract. This paper proposes to apply the branch and bound principle from combinatorial optimization to the Dissimilarity Self-Organizing Map (DSOM), a variant of the SOM that can...
Brieuc Conan-Guez, Fabrice Rossi
CP
2000
Springer
15 years 1 months ago
Boosting Search with Variable Elimination
Abstract. Variable elimination is the basic step of Adaptive Consistency 4 . It transforms the problem into an equivalent one, having one less variable. Unfortunately, there are ma...
Javier Larrosa
100
Voted
COLOGNETWENTE
2009
14 years 10 months ago
Improved Strategies for Branching on General Disjunctions
Abstract Within the context of solving Mixed-Integer Linear Programs by a Branch-andCut algorithm, we propose a new strategy for branching. Computational experiments show that, on ...
Gérard Cornuéjols, Leo Liberti, Giac...
IJCAI
1989
14 years 10 months ago
Utilization Filtering: A Method for Reducing the Inherent Harmfulness of Deductively Learned Knowledge
This paper highlights a phenomenon that causes deductively learned knowledge to be harmful when used for problem solving. The problem occurs when deductive problem solvers encount...
Shaul Markovitch, Paul D. Scott