6105 search results - page 998 / 1221 » A Parallel Algorithm for Bound-Smoothing |
160
click to vote
HPDC
2009
IEEE
16 years 1 months ago
2009
IEEE
Advances in the development of large scale distributed computing systems such as Grids and Computing Clouds have intensified the need for developing scheduling algorithms capable...
161
click to vote
ASPLOS
2000
ACM
15 years 11 months ago
2000
ACM
The emergence of the Internet as a trusted medium for commerce and communication has made cryptography an essential component of modern information systems. Cryptography provides ...
164
click to vote
ESOP
1990
Springer
15 years 10 months ago
1990
Springer
The need to integrate several versions of a program into a common one arises frequently, but it is a tedious and time consuming task to merge programs by hand. The program-integrat...
179
click to vote
SOFSEM
2000
Springer
15 years 10 months ago
2000
Springer
For half a century since computers came into existence, the goal of finding elegant and efficient algorithms to solve "simple" (welldefined and well-structured) problems ...
168
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 ...