Sciweavers

206 search results - page 38 / 42
» On the Complexity of Quantum ACC
Sort
View
CALCO
2005
Springer
104views Mathematics» more  CALCO 2005»
14 years 1 months ago
Abstract Scalars, Loops, and Free Traced and Strongly Compact Closed Categories
Scalars, Loops, and Free Traced and Strongly Compact Closed Categories Samson Abramsky Oxford University Computing Laboratory Wolfson Building, Parks Road, Oxford OX1 3QD, U.K. htt...
Samson Abramsky
IPPS
2003
IEEE
14 years 25 days ago
Global Communication Optimization for Tensor Contraction Expressions under Memory Constraints
The accurate modeling of the electronic structure of atoms and molecules involves computationally intensive tensor contractions involving large multi-dimensional arrays. The effi...
Daniel Cociorva, Xiaoyang Gao, Sandhya Krishnan, G...
GECCO
2006
Springer
181views Optimization» more  GECCO 2006»
13 years 11 months ago
Particle swarm with speciation and adaptation in a dynamic environment
This paper describes an extension to a speciation-based particle swarm optimizer (SPSO) to improve performance in dynamic environments. The improved SPSO has adopted several prove...
Xiaodong Li, Jürgen Branke, Tim Blackwell
GLVLSI
2010
IEEE
183views VLSI» more  GLVLSI 2010»
13 years 9 months ago
Semi-analytical model for schottky-barrier carbon nanotube and graphene nanoribbon transistors
This paper describes a physics-based semi-analytical model for Schottky-barrier carbon nanotube (CNT) and graphene nanoribbon (GNR) transistors. The model includes the treatment o...
Xuebei Yang, Gianluca Fiori, Giuseppe Iannaccone, ...
COCO
2008
Springer
97views Algorithms» more  COCO 2008»
13 years 9 months ago
Generalized Tsirelson Inequalities, Commuting-Operator Provers, and Multi-prover Interactive Proof Systems
A central question in quantum information theory and computational complexity is how powerful nonlocal strategies are in cooperative games with imperfect information, such as mult...
Tsuyoshi Ito, Hirotada Kobayashi, Daniel Preda, Xi...