Sciweavers

2089 search results - page 132 / 418
» A New Problem in String Searching
Sort
View
GECCO
2000
Springer
109views Optimization» more  GECCO 2000»
15 years 1 months ago
Crossover in Probability Spaces
This paper proposes a new crossover operator for searching over discrete probability spaces. The design of the operator is considered in the light of recent theoretical insights i...
Siddhartha Bhattacharyya, Marvin D. Troutt
ATAL
2006
Springer
15 years 1 months ago
No-commitment branch and bound search for distributed constraint optimization
We present a new polynomial-space algorithm for solving Distributed Constraint Optimization problems (DCOP). The algorithm, called NCBB, is branch and bound search with modificati...
Anton Chechetka, Katia P. Sycara
EDBT
2009
ACM
120views Database» more  EDBT 2009»
15 years 4 months ago
Retrieving meaningful relaxed tightest fragments for XML keyword search
Adapting keyword search to XML data has been attractive recently, generalized as XML keyword search (XKS). One of its key tasks is to return the meaningful fragments as the result...
Lingbo Kong, Rémi Gilleron, Aurélien...
EOR
2006
135views more  EOR 2006»
14 years 10 months ago
Principles of scatter search
Scatter search is an evolutionary method that has been successfully applied to hard optimization problems. The fundamental concepts and principles of the method were first propose...
Rafael Martí, Manuel Laguna, Fred Glover
CVPR
2010
IEEE
14 years 12 months ago
Compact Projection: Simple and Efficient Near Neighbor Search with Practical Memory Requirements
Image similarity search is a fundamental problem in computer vision. Efficient similarity search across large image databases depends critically on the availability of compact ima...
Kerui Min, Linjun Yang, John Wright, Lei Wu, Xian-...