Sciweavers

14774 search results - page 114 / 2955
» Computational complexity and evolutionary computation
Sort
View
123
Voted
ICPP
1994
IEEE
15 years 8 months ago
Computational Properties of Mesh Connected Trees: Versatile Architectures for Parallel Computation
Recently, the mesh connected trees (MCT) network has been proposed as a possible architecture for parallel computers. MCT networks are obtained by combining complete binary trees ...
Kemal Efe, Antonio Fernández
APAL
2010
125views more  APAL 2010»
15 years 4 months ago
The computable Lipschitz degrees of computably enumerable sets are not dense
The computable Lipschitz reducibility was introduced by Downey, Hirschfeldt and LaForte under the name of strong weak truthtable reducibility [6]. This reducibility measures both t...
Adam R. Day
GCC
2003
Springer
15 years 9 months ago
Computing Pool: A Simplified and Practical Computational Grid Model
Even though grid research is prosperous in an extensive context, few grid platforms for high performance computing are practical and in operation so far. Since most applications a...
Peng Liu, Yao Shi, Sanli Li
RECOMB
2005
Springer
16 years 4 months ago
Maximum Likelihood of Evolutionary Trees Is Hard
Benny Chor, Tamir Tuller