Sciweavers

197 search results - page 1 / 40
» A Parallel Algorithm for Solving Large Convex Minimax Proble...
Sort
View
SEAL
2010
Springer
13 years 2 months ago
A Parallel Algorithm for Solving Large Convex Minimax Problems
Ramnik Arora, Utkarsh Upadhyay, Rupesh Tulshyan, J...
CDC
2009
IEEE
169views Control Systems» more  CDC 2009»
13 years 9 months ago
Parametric regret in uncertain Markov decision processes
— We consider decision making in a Markovian setup where the reward parameters are not known in advance. Our performance criterion is the gap between the performance of the best ...
Huan Xu, Shie Mannor
AAAI
1998
13 years 6 months ago
Finding Optimal Strategies for Imperfect Information Games
Weexaminethree heuristic algorithms for gameswith imperfect information: Monte-carlo sampling, and two newalgorithms wecall vector minimaxingand payoffreduction minimaxing. Wecomp...
Ian Frank, David A. Basin, Hitoshi Matsubara
JPDC
1998
125views more  JPDC 1998»
13 years 4 months ago
Solving Large-Scale QAP Problems in Parallel with the Search Library ZRAM
Programlibraries are one tool to make the cooperation between specialists from various elds successful: the separation of application-speci c knowledge from applicationindependent...
Adrian Brüngger, Ambros Marzetta, Jens Clause...
ICPP
2008
IEEE
13 years 11 months ago
Solving Large, Irregular Graph Problems Using Adaptive Work-Stealing
Solving large, irregular graph problems efficiently is challenging. Current software systems and commodity multiprocessors do not support fine-grained, irregular parallelism wel...
Guojing Cong, Sreedhar B. Kodali, Sriram Krishnamo...