Sciweavers

1289 search results - page 130 / 258
» Complexity of Counting the Optimal Solutions
Sort
View
NIPS
2003
15 years 2 months ago
Robustness in Markov Decision Problems with Uncertain Transition Matrices
Optimal solutions to Markov Decision Problems (MDPs) are very sensitive with respect to the state transition probabilities. In many practical problems, the estimation of those pro...
Arnab Nilim, Laurent El Ghaoui
108
Voted
IPPS
2010
IEEE
14 years 10 months ago
Parallel external memory graph algorithms
In this paper, we study parallel I/O efficient graph algorithms in the Parallel External Memory (PEM) model, one of the private-cache chip multiprocessor (CMP) models. We study the...
Lars Arge, Michael T. Goodrich, Nodari Sitchinava
139
Voted
IEEECIT
2010
IEEE
14 years 10 months ago
SESAM: An MPSoC Simulation Environment for Dynamic Application Processing
Future systems will have to support multiple and concurrent dynamic compute-intensive applications, while respecting real-time and energy consumption constraints. With the increase...
Nicolas Ventroux, Alexandre Guerre, Tanguy Sassola...
154
Voted
DISOPT
2011
201views Education» more  DISOPT 2011»
14 years 4 months ago
The Wiener maximum quadratic assignment problem
We investigate a special case of the maximum quadratic assignment problem where one matrix is a product matrix and the other matrix is the distance matrix of a one-dimensional poi...
Eranda Çela, Nina S. Schmuck, Shmuel Wimer,...
112
Voted
ICAI
2010
14 years 10 months ago
Exact Loopy Belief Propagation on Euler Graphs
Belief propagation is widely used in inference of graphical models. It yields exact solutions when the underlying graph is singly connected. When the graph contains loops, double-c...
Chen-Hsiang Yeang