1686 search results - page 187 / 338 » Programs as polygraphs: computability and complexity |
150
click to vote
JUCS
2006
15 years 3 months ago
2006
Abstract: Combinatorial property testing, initiated formally by Goldreich, Goldwasser, and Ron in [Goldreich et al. (1998)] and inspired by Rubinfeld and Sudan in [Rubinfeld and Su...
154
click to vote
EH
1999
IEEE
15 years 8 months ago
1999
IEEE
We address the fundamental issue of fully automated design (FAD) and construction of inexpensive robots and their controllers. Rather than seek an intelligent general purpose robo...
139
click to vote
ICALP
2010
Springer
15 years 8 months ago
2010
Springer
Knowledge extraction is a fundamental notion, modeling machine possession of values (witnesses) in a computational complexity sense and enabling one to argue about the internal st...
185
click to vote
DAC
2006
ACM
16 years 4 months ago
2006
ACM
Modern integrated circuits (ICs) are becoming increasingly complex. The complexity makes it difficult to design, manufacture and integrate these high-performance ICs. The advent o...
127
Voted
PIMRC
2008
IEEE
15 years 10 months ago
2008
IEEE
—In this paper, we address the problem of computing the transport capacity of Wireless Mesh Networks dedicated to Internet access. Routing and transmission scheduling have a majo...