Learning parallel portfolios of algorithms-Reference-Cited by-同舟云学术

Learning parallel portfolios of algorithms

Published:2007-05-25 Issue:1-2 Volume:48 Page:85-106
ISSN:1012-2443
Container-title:Annals of Mathematics and Artificial Intelligence
language:en
Short-container-title:Ann Math Artif Intell

Author:

Petrik Marek,Zilberstein Shlomo

Publisher

Springer Science and Business Media LLC

Subject

Applied Mathematics,Artificial Intelligence

Link

http://link.springer.com/content/pdf/10.1007/s10472-007-9050-9.pdf

Reference14 articles.

1. Arnt, A., Zilberstein, S., Allen, J: Dynamic composition of information retrieval techniques. J. Intell. Inf. Syst. 23(1), 67–97 (2004)

2. Bertsekas, D.P.: Nonlinear Programming. Athena Scientific, Belmont, MA (2003)

3. Dean, T.L.: Intractability and time-dependent planning. In: Proceedings of the 1986 Workshop on Reasoning about Actions and Plans, pp. 245–266. Morgan Kaufmann, San Francisco, CA (1986)

4. Devroye, L., Gyorfi, L., Lugosi, G.: A Probabilistic Theory of Pattern Recognition. Springer, New York (1996)

5. Gomes, C., Selman, B.: Algorithm portolios. Artif. Intell. 126(1- 2), 43–62 (2001)

Cited by 11 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Real-time solving of computationally hard problems using optimal algorithm portfolios;Annals of Mathematics and Artificial Intelligence;2020-08-28

2. Adaptive Outcome Selection for Planning with Reduced Models;2019 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS);2019-11

3. Parallel Satisfiability Modulo Theories;Handbook of Parallel Constraint Reasoning;2018

4. Parallel population-based algorithm portfolios: An empirical study;Neurocomputing;2017-07

5. Algorithm Selection for Combinatorial Search Problems: A Survey;Data Mining and Constraint Programming;2016