Sciweavers

15485 search results - page 371 / 3097
» Computing Optimal Subsets
Sort
View
MASCOTS
2004
15 years 8 months ago
A Framework for Resource Allocation in Grid Computing
Grid computing is the future computing paradigm for enterprise applications. An enterprise application running on a grid is composed of a set of SLA-constrained sub-tasks demandin...
Daniel A. Menascé, Emiliano Casalicchio
UAI
2001
15 years 8 months ago
Iterative Markov Chain Monte Carlo Computation of Reference Priors and Minimax Risk
We present an iterative Markov chain Monte Carlo algorithm for computing reference priors and minimax risk for general parametric families. Our approach uses MCMC techniques based...
John D. Lafferty, Larry A. Wasserman
AAAI
1994
15 years 8 months ago
A Computational Market Model for Distributed Configuration Design
This paper presents a precise market model for a well-defined class of distributed configuration design problems. Given a design problem, the model defines a computational economy...
Michael P. Wellman
MVA
1996
129views Computer Vision» more  MVA 1996»
15 years 8 months ago
Computation of Optical Flow Using Dynamic Programming
This paper presents an original algorithm for the computation of optical ow called Orthogonal Dynamic Programming (ODP) as well as several enhancements to it. The principle is to ...
Georges Quénot
COR
2008
175views more  COR 2008»
15 years 6 months ago
Lower and upper bounds for a two-level hierarchical location problem in computer networks
In this paper a two-level hierarchical model for the location of concentrators and routers in computers networks is presented. Given a set of candidate locations and the capacitie...
Aníbal Alberto Vilcapoma Ignacio, Virg&iacu...