Sciweavers

629 search results - page 3 / 126
» The Generalized Quantum Database Search Algorithm
Sort
View
FOCS
2003
IEEE
15 years 2 months ago
Quantum Search of Spatial Regions
: Can Grover’s algorithm speed up search of a physical region—for example a 2-D grid of size √ n × √ n? The problem is that √ n time seems to be needed for each query, j...
Scott Aaronson, Andris Ambainis
APPROX
2008
Springer
89views Algorithms» more  APPROX 2008»
14 years 11 months ago
Quantum and Randomized Lower Bounds for Local Search on Vertex-Transitive Graphs
We study the problem of local search on a graph. Given a real-valued black-box function f on the graph's vertices, this is the problem of determining a local minimum of f--a v...
Hang Dinh, Alexander Russell
GECCO
2008
Springer
161views Optimization» more  GECCO 2008»
14 years 10 months ago
A new quantum behaved particle swarm optimization
This paper presents a variant of Quantum behaved Particle Swarm Optimization (QPSO) named Q-QPSO for solving global optimization problems. The Q-QPSO algorithm is based on the cha...
Millie Pant, Radha Thangaraj, Ajith Abraham
CORR
2010
Springer
102views Education» more  CORR 2010»
14 years 4 months ago
Superior Exploration-Exploitation Balance with Quantum-Inspired Hadamard Walks
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-...
Sisir Koppaka, Ashish Ranjan Hota
CIKM
2009
Springer
15 years 4 months ago
A general magnitude-preserving boosting algorithm for search ranking
Traditional boosting algorithms for the ranking problems usually employ the pairwise approach and convert the document rating preference into a binary-value label, like RankBoost....
Chenguang Zhu, Weizhu Chen, Zeyuan Allen Zhu, Gang...