Sciweavers

387 search results - page 3 / 78
» Can quantum search accelerate evolutionary algorithms
Sort
View
ALGORITHMICA
2010
92views more  ALGORITHMICA 2010»
13 years 5 months ago
Quantum Separation of Local Search and Fixed Point Computation
In this paper, we give a lower bound of (n(d-1)/2 ) on the quantum query complexity for finding a fixed point of a discrete Brouwer function over grid [1 : n]d . Our bound is near...
Xi Chen, Xiaoming Sun, Shang-Hua Teng
BMCBI
2007
233views more  BMCBI 2007»
13 years 5 months ago
160-fold acceleration of the Smith-Waterman algorithm using a field programmable gate array (FPGA)
Background: To infer homology and subsequently gene function, the Smith-Waterman (SW) algorithm is used to find the optimal local alignment between two sequences. When searching s...
Isaac T. S. Li, Warren Shum, Kevin Truong
COCOON
2005
Springer
13 years 10 months ago
Promised and Distributed Quantum Search
This paper gives a quantum algorithm to search in an set S for a k-tuple satisfying some predefined relation, with the promise that some components of a desired k-tuple are in som...
Shengyu Zhang
ISNN
2009
Springer
13 years 11 months ago
An Improved Quantum Evolutionary Algorithm with 2-Crossovers
Quantum evolutionary algorithm (QEA) is proposed on the basis of the concept and principles of quantum computing, which is a classical metaheuristic algorithm for the approximate s...
Zhihui Xing, Haibin Duan, Chunfang Xu
CEC
2010
IEEE
13 years 6 months ago
Accelerated optimisation of chemotherapy dose schedules using fitness inheritance
Abstract-- Cancer treatment by chemotherapy involves multiple applications of toxic drugs over a period of time. Optimising the schedule of these treatments can improve the outcome...
Robert Barbour, David W. Corne, John A. W. McCall