7195 search results - page 626 / 1439 » On Computing Power |
171
click to vote
VLSID
2002
IEEE
16 years 7 months ago
2002
IEEE
Verification is one of the most complex and expensive tasks in the current Systems-on-Chip (SOC) design process. Many existing approaches employ a bottom-up approach to pipeline v...
196
click to vote
SDM
2009
SIAM
16 years 4 months ago
2009
SIAM
Most commonly used inductive rule learning algorithms employ a hill-climbing search, whereas local pattern discovery algorithms employ exhaustive search. In this paper, we evaluat...
196
click to vote
COCO
2008
Springer
15 years 9 months ago
2008
Springer
A central question in quantum information theory and computational complexity is how powerful nonlocal strategies are in cooperative games with imperfect information, such as mult...
168
click to vote
ICLP
1993
Springer
15 years 11 months ago
1993
Springer
A basic requirement of declarative programming is to free the programmer from the need to manually insert control annotations into the program. Here we study the execution of logi...
162
click to vote
DAC
2004
ACM
16 years 8 months ago
2004
ACM
Starting from a model of the within-die systematic variations using principal components analysis, a model is proposed for estimation of the parametric yield, and is then applied ...