Eigenvectors to the second smallest eigenvalue of the Laplace matrix of a graph, also known as Fiedler vectors, are the basic ingredient in spectral graph partitioning heuristics....
This paper discusses how to find the global minimum of functions that are summations of small polynomials ("small" means involving a small number of variables). Some spa...
Abstract. We present a new derivative-free algorithm, ORBIT, for unconstrained local optimization of computationally expensive functions. A trust-region framework using interpolati...
Stefan M. Wild, Rommel G. Regis, Christine A. Shoe...
The grid vision of a single computing utility has yet to materialize: while many grids with thousands of processors each exist, most work in isolation. An important obstacle for t...
Alexandru Iosup, Todd Tannenbaum, Matthew Farrelle...
In the paper, a cross-layer optimization between application layer and fabric layer is proposed. The aim is to optimize the end-to-end quality of the dynamic grid application as we...