2214 search results - page 213 / 443 » Complexity of Reasoning |
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...
154
click to vote
FOCS
1995
IEEE
15 years 7 months ago
1995
IEEE
This paper continues the investigation of the connection between probabilistically checkable proofs PCPs the approximability of NP-optimization problems. The emphasis is on prov...
136
Voted
SIAMCOMP
1998
15 years 3 months ago
1998
A language is L-printable if there is a logspace algorithm which, on input 1n, prints all members in the language of length n. Following the work of Allender and Rubinstein [SIAM J...
127
click to vote
CAISE
2004
Springer
15 years 9 months ago
2004
Springer
tween documents. They should allow for an abstract representation of data which resembles the way they are actually perceived and used in the real world, thus shortening (with resp...
153
click to vote
RTSS
2007
IEEE
15 years 10 months ago
2007
IEEE
In the last years, a progressive migration from single processor chips to multi-core computing devices has taken place in the general-purpose and embedded system market. The devel...