Sciweavers

1686 search results - page 10 / 338
» Programs as polygraphs: computability and complexity
Sort
View
59
Voted
ICALP
2009
Springer
15 years 10 months ago
The Tile Complexity of Linear Assemblies
Harish Chandran, Nikhil Gopalkrishnan, John H. Rei...
ASPLOS
2011
ACM
14 years 1 months ago
On-the-fly elimination of dynamic irregularities for GPU computing
The power-efficient massively parallel Graphics Processing Units (GPUs) have become increasingly influential for scientific computing over the past few years. However, their ef...
Eddy Z. Zhang, Yunlian Jiang, Ziyu Guo, Kai Tian, ...
ECCC
2002
103views more  ECCC 2002»
14 years 9 months ago
Monotone complexity and the rank of matrices
We shall give simpler proofs of some lower bounds on monotone computations. We describe a simple condition on combinatorial structures, such that the rank of the matrix associated...
Pavel Pudlák
ICALP
2005
Springer
15 years 3 months ago
The Complexity of Stochastic Rabin and Streett Games'
Krishnendu Chatterjee, Luca de Alfaro, Thomas A. H...
GPEM
2000
126views more  GPEM 2000»
14 years 9 months ago
Automatic Creation of Human-Competitive Programs and Controllers by Means of Genetic Programming
Genetic programming is an automatic method for creating a computer program or other complex structure to solve a problem. This paper first reviews various instances where genetic p...
John R. Koza, Martin A. Keane, Jessen Yu, Forrest ...