1701 search results - page 121 / 341 » Computer Science and State Machines |
139
click to vote
STOC
1997
ACM
15 years 2 months ago
1997
ACM
We present randomized constructions of linear-time encodable and decodable codes that can transmit over lossy channels at rates extremely close to capacity. The encoding and decod...
IPPS
2006
IEEE
15 years 4 months ago
2006
IEEE
As the desire of scientists to perform ever larger computations drives the size of today’s high performance computers from hundreds, to thousands, and even tens of thousands of ...
FGCS
2010
14 years 8 months ago
2010
Grid computing has been the subject of many large national and international IT projects in the past. However, it seems that the general expectations in Grids have not come true. ...
STACS
2012
Springer
13 years 5 months ago
2012
Springer
The Denjoy-Young-Saks Theorem from classical analysis states that for an arbitrary function f : R → R, the Denjoy alternative holds outside a null set, i.e., for almost every re...
113
click to vote
AOSD
2011
ACM
14 years 1 months ago
2011
ACM
Object-oriented frameworks support design and code reuse for specific application domains. To facilitate the development of evolutionary computation (EC) programs, such as geneti...