9997 search results - page 189 / 2000 » The case for crowd computing |
210
click to vote
ECCC
2011
14 years 11 months ago
2011
Polynomial identity testing (PIT) problem is known to be challenging even for constant depth arithmetic circuits. In this work, we study the complexity of two special but natural ...
120
click to vote
CHI
2007
ACM
16 years 4 months ago
2007
ACM
We present the case study of a complex, mixed-initiative scheduling system to illustrate Work-Centered Design (WCD), a new approach for the design of information systems. WCD is b...
150
click to vote
COCO
2005
Springer
15 years 10 months ago
2005
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 ...
179
click to vote
LCTRTS
2000
Springer
15 years 8 months ago
2000
Springer
The control system of many complex mechatronic products requires for each task the Worst Case Execution Time (WCET), which is needed for the scheduler's admission tests and su...
127
click to vote
CC
2007
Springer
15 years 4 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 ...