10271 search results - page 1580 / 2055 » Computer Science |
190
click to vote
ICS
2010
Tsinghua U.
16 years 4 months ago
2010
Tsinghua U.
In this paper we study the possibility of proving the existence of one-way functions based on average case hardness. It is well-known that if there exists a polynomial-time sample...
171
click to vote
IPPS
2007
IEEE
16 years 1 months ago
2007
IEEE
The goal of the work described in this paper is to design and build a scalable infrastructure for executing grid applications on a widely distributed set of resources. Such grid i...
177
click to vote
HPDC
2010
IEEE
15 years 8 months ago
2010
IEEE
Scientists working in eScience environments often use workflows to carry out their computations. Since the workflows evolve as the research itself evolves, these workflows can be ...
173
click to vote
ECAI
2000
Springer
15 years 11 months ago
2000
Springer
This paper proposes new algorithms for the Binate Covering Problem (BCP), a well-known restriction of Boolean Optimization. Binate Covering finds application in many areas of Com...
202
click to vote
AMAI
2000
Springer
15 years 10 months ago
2000
Springer
This paper proposes new algorithms for the Binate Covering Problem (BCP), a well-known restriction of Boolean Optimization. Binate Covering finds application in many areas of Comp...