3055 search results - page 382 / 611 » Randomized Search Trees |
151
click to vote
AAAI
1996
15 years 5 months ago
1996
Two methods are described for enhancing performance of branch and bound methods for overconstrained CSPS. These methods improve either the upper or lower bound, respectively, duri...
118
click to vote
EC
2002
15 years 3 months ago
2002
In this paper, we develop techniques based on evolvability statistics of the fitness landscape surrounding sampled solutions. Averaging the measures over a sample of equal fitness...
155
click to vote
CORR
2010
Springer
14 years 11 months ago
2010
Springer
This paper extends the analogies employed in the development of quantum-inspired evolutionary algorithms by proposing quantum-inspired Hadamard walks, called QHW. A novel quantum-...
177
Voted
CTRSA
2012
Springer
13 years 11 months ago
2012
Springer
We study the problem of searching on encrypted data, where the search is performed using a plaintext message or a keyword, rather than a message-specific trapdoor as done by state...
140
Voted
SSDBM
2003
IEEE
15 years 9 months ago
2003
IEEE
The growing interest in genomic research has caused an explosive growth in the size of DNA databases making it increasely challenging to perform searches on them. In this paper, w...