|
Learning Heuristic Functions Through Approximate Linear Programming Marek Petrik and Shlomo Zilberstein. To appear in International Conference on Automated Planning and Scheduling (ICAPS) 2008. [PDF] |
|
Interaction Structure and Dimensionality Reduction in Decentralized MDPs Martin Allen and Marek Petrik and Shlomo Zilberstein. In the National Conference on Artificial Intelligence (AAAI), 2008. Short paper. [PDF] Tech report #UM-CS-2008-11 [PDF] |
|
A Successive Approximation Algorithm for Coordination Problems Marek Petrik and Shlomo Zilberstein. In the 9th International Symposium on Artificial Intelligence and Mathematics, Fort Lauderdale, Florida, January, 2008 [PDF] |
|
Anytime Coordination Using Separable Bilinear Programs Marek Petrik, Shlomo Zilberstein. In the National Conference on Artificial Intelligence (AAAI), 2007. (Corrected) [PDF] |
|
An Analysis of Laplacian Methods for Value Function Approximation in MDPs. Marek Petrik. In the International Joint Conference on Artificial Intelligence (IJCAI), 2007. (Corrected) [PDF] |
|
Average-Reward Decentralized Markov Decision Processes. Marek Petrik, Shlomo Zilberstein. In the International Joint Conference on Artificial Intelligence (IJCAI), 2007. [PDF] |
|
Learning Parallel Portfolios of Algorithms Marek Petrik, Shlomo Zilberstein Annals of Mathematics and Artificial Intelligence, 48(1-2):85-106, 2006 |
|
Learning Static Parallel Portfolios of Algorithms. Marek Petrik, Shlomo Zilberstein. In the 9th International Symposium on Artificial Intelligence and Mathematics, Fort Lauderdale, Florida, January 4-6, 2006. [PDF] |
|
Learning Parallel Portfolios of Algorithms. Marek Petrik. Diploma (Master) Thesis at Comenius University. Defended on June 7th 2005. [PDF] [Code] [Slides] |
|
Constrained Dynamic Programming for TSPTW. Marek Petrik. Whitestein Technologies Technical Report. [Email] |
| Statistically Optimal Combination of Algorithms. Marek Petrik. In the local proceedings of Sofsem 2005. (Best Student Poster). [PDF] |