400 search results - page 50 / 80 » Lower Bounds Using Kolmogorov Complexity |
114
Voted
CORR
2008
Springer
15 years 1 months ago
2008
Springer
The classical problem of reliable point-to-point digital communication is to achieve a low probability of error while keeping the rate high and the total power consumption small. ...
120
Voted
FOCS
2004
IEEE
15 years 5 months ago
2004
IEEE
In the cyclic-to-random shuffle, we are given n cards arranged in a circle. At step k, we exchange the k'th card along the circle with a uniformly chosen random card. The pro...
121
click to vote
KI
2008
Springer
15 years 1 months ago
2008
Springer
Abstract. Modal logics see a wide variety of applications in artificial intelligence, e.g. in reasoning about knowledge, belief, uncertainty, agency, defaults, and relevance. From ...
101
Voted
STOC
2001
ACM
16 years 2 months ago
2001
ACM
Optimal program slicing determines for a statement S in a program whether or not S affects a specified set of statements, given that all conditionals in are interpreted as non-d...
ACAL
2007
Springer
15 years 8 months ago
2007
Springer
There has been some ambiguity about the growth of attractors in Kauffman networks with network size. Some recent work has linked this to the role and growth of circuits or loops o...