Sciweavers

152 search results - page 4 / 31
» Why is quantum physics based on complex numbers
Sort
View
FOCS
2006
IEEE
14 years 1 months ago
On the Quantum Query Complexity of Local Search in Two and Three Dimensions
The quantum query complexity of searching for local optima has been a subject of much interest in the recent literature. For the d-dimensional grid graphs, the complexity has been...
Xiaoming Sun, Andrew Chi-Chih Yao
COCO
2000
Springer
65views Algorithms» more  COCO 2000»
13 years 12 months ago
On the Complexity of Quantum ACC
For any q > 1, let MODq be a quantum gate that determines if the number of 1’s in the input is divisible by q. We show that for any q, t > 1, MODq is equivalent to MODt (u...
Frederic Green, Steven Homer, Chris Pollett
EUROPAR
2003
Springer
14 years 25 days ago
Why Not Use a Pattern-Based Parallel Programming System?
Parallel programming is seen as an effective technique to improve the performance of computationally-intensive programs. This is done at the cost of increasing the complexity of t...
John Anvik, Jonathan Schaeffer, Duane Szafron, Kai...
CGF
2006
139views more  CGF 2006»
13 years 7 months ago
Pose Controlled Physically Based Motion
In this paper we describe a new method for generating and controlling physically-realistic motion of complex articulated characters. Our goal is to create motion from scratch, whe...
Raanan Fattal, Dani Lischinski
GECCO
2006
Springer
161views Optimization» more  GECCO 2006»
13 years 11 months ago
An empirical investigation of how and why neutrality affects evolutionary search
The effects of neutrality on evolutionary search have been considered in a number of interesting studies, the results of which, however, have been contradictory. Some researchers ...
Edgar Galván López, Riccardo Poli