5832 search results - page 766 / 1167 » Software complexity and maintainability |
184
click to vote
CC
2007
Springer
15 years 6 months ago
2007
Springer
We prove that if NP ⊆ BPP, i.e., if SAT is worst-case hard, then for every probabilistic polynomial-time algorithm trying to decide SAT, there exists some polynomially samplable ...
184
click to vote
CASES
2010
ACM
15 years 4 months ago
2010
ACM
Mobile computing platforms in the form of smart phones, netbooks, and personal digital assistants have become an integral part of our everyday lives. Moving ahead to the future, m...
210
click to vote
PPOPP
2012
ACM
14 years 2 months ago
2012
ACM
We introduce the first binary search tree algorithm designed for speculative executions. Prior to this work, tree structures were mainly designed for their pessimistic (non-specu...
162
click to vote
DAC
2004
ACM
16 years 7 months ago
2004
ACM
Reconfigurable Systems-on-Chip (SoCs) on the market consist of full-fledged processors and large Field-Programmable Gate-Arrays (FPGAs). The latter can be used to implement the sy...
188
click to vote
SIGSOFT
2008
ACM
16 years 7 months ago
2008
ACM
Many testing and analysis techniques have been developed for inhouse use. Although they are effective at discovering defects before a program is deployed, these techniques are oft...