1210 search results - page 230 / 242 » Formal Techniques for Java Programs |
STOC
1998
ACM
13 years 11 months ago
1998
ACM
We present a Monte Carlo algorithm for testing multivariate polynomial identities over any field using fewer random bits than other methods. To test if a polynomial P(x1 ::: xn) ...
UAI
2001
13 years 8 months ago
2001
In this work we focus on efficient heuristics for solving a class of stochastic planning problems that arise in a variety of business, investment, and industrial applications. The...
CORR
2007
Springer
13 years 7 months ago
2007
Springer
Analytic execution architectures have been proposed by the same authors as a means to conceptualize the cooperation between heterogeneous collectives of components such as program...
PAAPP
2006
13 years 7 months ago
2006
In this paper, we investigate algorithms for generating communication code to run on distributedmemory systems. We modify algorithms from previously published work and prove that ...
JAIR
2007
13 years 7 months ago
2007
Most classical scheduling formulations assume a fixed and known duration for each activity. In this paper, we weaken this assumption, requiring instead that each duration can be ...