8512 search results - page 242 / 1703 » Computing Theory With Relevance |
115
Voted
DAM
2006
15 years 5 months ago
2006
Andrews et al. [Automatic method for hiding latency in high bandwidth networks, in: Proceedings of the ACM Symposium on Theory of Computing, 1996, pp. 257
124
click to vote
CORR
2007
Springer
15 years 5 months ago
2007
Springer
We define a class of “algebraic” random matrix channels for which one can generically compute the limiting Shannon transform using numerical techniques and often enumerate th...
121
click to vote
FUIN
1998
15 years 4 months ago
1998
The theory of evolutionary computation has been enhanced rapidly during the last decade. This survey is the attempt to summarize the results regarding the limit and nite time behav...
146
click to vote
CSL
2010
Springer
15 years 6 months ago
2010
Springer
We shall discuss several situations in which it is possible to extract from a proof, be it a proof in a first-order theory or a propositional proof, some feasible computational inf...
131
click to vote
COCOON
2003
Springer
15 years 10 months ago
2003
Springer
Abstract. We show that finding roots of Boolean matrices is an NPhard problem. This answers a twenty year old question from semigroup theory. Interpreting Boolean matrices as dire...