2474 search results - page 485 / 495 » Solving Problems on Parallel Computers by Cellular Programmi... |
ANCS
2005
ACM
14 years 1 months ago
2005
ACM
New network applications like intrusion detection systems and packet-level accounting require multi-match packet classification, where all matching filters need to be reported. Te...
COCO
2005
Springer
14 years 1 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 ...
CC
2007
Springer
13 years 7 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 ...
SIGUCCS
1998
ACM
13 years 11 months ago
1998
ACM
There are many ways to train student employees, but hands-on experience is invaluable. To provide our Resident Computer Consultants (RCCs) with the experience they need to solve t...
DAC
2005
ACM
14 years 8 months ago
2005
ACM
We obtain analytically, the energy optimal speed profile of a generic multi-speed device with a discrete set of speeds, to execute a given task within a given time. Current implem...