1534 search results - page 69 / 307 » Stochastic Bounds on Execution Times of Parallel Computation... |
COR
2007
13 years 7 months ago
2007
We present a framework for solving multistage pure 0–1 programs for a widely used sequencing and scheduling problem with uncertainty in the objective function coefficients, the...
IPPS
2009
IEEE
14 years 2 months ago
2009
IEEE
We are interested in this paper to study scheduling problems in systems where many users compete to perform their respective jobs on shared parallel resources. Each user has speci...
IPPS
1997
IEEE
14 years 3 hour ago
1997
IEEE
The 0 1 MultidimensionalKnapsack Problem (0 1 MKP) is a NP-complete problem. Its resolution for large scale instances requires a prohibitive processing time. In this paper we prop...
TCS
2008
13 years 7 months ago
2008
Formalized study of self-assembly has led to the definition of the tile assembly model, a highly distributed parallel model of computation that may be implemented using molecules ...
CRYPTO
2000
Springer
14 years 4 days ago
2000
Springer
Secure Function Evaluation (SFE) protocols are very hard to design, and reducibility has been recognized as a highly desirable property of SFE protocols. Informally speaking, reduc...