782 search results - page 99 / 157 » MB-DPOP: A New Memory-Bounded Algorithm for Distributed Opti... |
WWW
2006
ACM
14 years 8 months ago
2006
ACM
Wide-area distributed applications are challenging to debug, optimize, and maintain. We present Wide-Area Project 5 (WAP5), which aims to make these tasks easier by exposing the c...
IPPS
1994
IEEE
13 years 12 months ago
1994
IEEE
The matrix chain ordering problem is to find the cheapest way to multiply a chain of n matrices, where the matrices are pairwise compatible but of varying dimensions. Here we give ...
ESA
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. We present a first constant performance guarantee for preemptive stochastic scheduling to minimize the sum of weighted completion times. For scheduling jobs with release ...
ICCAD
2003
IEEE
14 years 1 months ago
2003
IEEE
This work presents a formal probabilistic approach for solving optimization problems in design automation. Prediction accuracy is very low especially at high levels of design flo...
ANOR
2005
13 years 7 months ago
2005
An alternate formulation of the classical vehicle routing problem with stochastic demands (VRPSD) is considered. We propose a new heuristic method to solve the problem. The algori...