Sciweavers

2657 search results - page 169 / 532
» On the complexity of hierarchical problem solving
Sort
View
ICML
2006
IEEE
16 years 2 months ago
Convex optimization techniques for fitting sparse Gaussian graphical models
We consider the problem of fitting a large-scale covariance matrix to multivariate Gaussian data in such a way that the inverse is sparse, thus providing model selection. Beginnin...
Onureena Banerjee, Laurent El Ghaoui, Alexandre d'...
ALDT
2009
Springer
142views Algorithms» more  ALDT 2009»
15 years 8 months ago
Finding Best k Policies
Abstract. An optimal probabilistic-planning algorithm solves a problem, usually modeled by a Markov decision process, by finding its optimal policy. In this paper, we study the k ...
Peng Dai, Judy Goldsmith
IAT
2009
IEEE
15 years 5 months ago
Offline Planning for Communication by Exploiting Structured Interactions in Decentralized MDPs
Variants of the decentralized MDP model focus on problems exhibiting some special structure that makes them easier to solve in practice. Our work is concerned with two main issues...
Hala Mostafa, Victor R. Lesser
CCE
2008
15 years 1 months ago
Chance constrained programming approach to process optimization under uncertainty
Deterministic optimization approaches have been well developed and widely used in the process industry to accomplish off-line and on-line process optimization. The challenging tas...
Pu Li, Harvey Arellano-Garcia, Günter Wozny
FSTTCS
2008
Springer
15 years 2 months ago
Average-Time Games
An average-time game is played on the infinite graph of configurations of a finite timed automaton. The two players, Min and Max, construct an infinite run of the automaton by ...
Marcin Jurdzinski, Ashutosh Trivedi