5316 search results - page 293 / 1064 » Which Search Problems Are Random |
169
click to vote
PPSN
1998
Springer
15 years 10 months ago
1998
Springer
In previous work, we have investigated real coded genetic algorithms with several types of multi-parent recombination operators and found evidence that multi-parent recombination w...
197
click to vote
ALENEX
2001
15 years 7 months ago
2001
In nearest neighbor searching we are given a set of n data points in real d-dimensional space, d , and the problem is to preprocess these points into a data structure, so that give...
170
click to vote
AI
2011
Springer
15 years 1 months ago
2011
Springer
The paper focuses on developing effective importance sampling algorithms for mixed probabilistic and deterministic graphical models. The use of importance sampling in such graphi...
225
click to vote
GECCO
2007
Springer
15 years 10 months ago
2007
Springer
The traditional GA theory is pillared on the Building Block Hypothesis (BBH) which states that Genetic Algorithms (GAs) work by discovering, emphasizing and recombining low order ...
258
click to vote
SIGMOD
2009
ACM
16 years 6 months ago
2009
ACM
Existing works in XML keyword search have addressed the problem of finding matching results of a query. However, user input queries always contain irrelevant or mismatched terms, ...