8699 search results - page 253 / 1740 » Elements of the Theory of Computation |
142
click to vote
DAC
2009
ACM
16 years 7 months ago
2009
ACM
In this study, we apply a novel synthesis technique for implementing robust digital computation in nanoscale lattices with random interconnects: percolation theory on random graph...
155
click to vote
FCT
2009
Springer
16 years 1 months ago
2009
Springer
In social network theory, a simple graph G is called k-role assignable if there is a surjective mapping that assigns a number from {1, . . . , k} called a role to each vertex of G ...
176
click to vote
SIGCSE
2008
ACM
15 years 6 months ago
2008
ACM
Inclusive education is the practice of making sure that all students of all abilities have positive learning experiences. The study presented in this paper explores the current st...
263
click to vote
FOGA
2011
14 years 10 months ago
2011
Analyzing the computational complexity of evolutionary algorithms (EAs) for binary search spaces has significantly informed our understanding of EAs in general. With this paper, ...
169
click to vote
SOFSEM
2009
Springer
15 years 11 months ago
2009
Springer
In this text we will discuss different forms of randomness in Natural Sciences and present some recent results relating them. In finite processes, randomness differs in various ...