注册 | 登录 | FAQ      [?] 
Recent | Unread | Search | Authors | Tags | Export

gagliol's gagliolo-phd [33 articles]

当前文献位于 gagliol's 文献库 标签分类为 gagliolo-phd. You can also see everyone's gagliolo-phd.
  • Groups of diverse problem solvers can outperform groups of high-ability problem solvers
    Proceedings of the National Academy of Sciences, Vol. 101, No. 46. (16 November 2004), pp. 16385-16389.
    by Lu Hong, Scott E Page
    posted to printed gagliolo-phd algorithm-portfolios by gagliol on 2008-04-24 14:20:23 as **
  • Issues in Runtime Algorithm Selection for Grid Environments
    (2003)
    by Prachi Bora, Calvin Ribbens, Sandeep Prabhakar, Gautam Swaminathan, Malarvizhi Chinnusamy, Ashwin Jeyakumar, Beatriz Diaz-Acosta
    posted to algorithm-selection gagliolo-phd grid-computing printed by gagliol on 2008-04-16 18:47:06 as **
  • Meta-Learning: Concepts and Techniques
    (2005)
    by R Vilalta, C Giraud-Carrier, P Brazdil
    edited by Oded Maimon, Lior Rokach
    posted to gagliolo-phd meta-learning printed by gagliol on 2008-03-12 16:24:58 as **
  • A Randomized Parallel Backtracking Algorithm
    IEEE Trans. Comput., Vol. 37, No. 12. (December 1988), pp. 1665-1676.
    by VK Janakiram, DP Agrawal, R Mehrotra
    posted to algorithm-portfolios backtracking-search gagliolo-phd parallel-computing printed randomized-algorithms runtime-distributions by gagliol on 2008-01-15 14:07:23 as **
  • Optimal Schedules for Parallelizing Anytime Algorithms: The Case of Independent Processes
    (2002)
    by Lev Finkelstein, Shaul Markovitch, Ehud Rivlin
    posted to algorithm-portfolios anytime-algorithms gagliolo-phd parallel-computing printed runtime-distributions by gagliol on 2008-01-15 13:49:51 as **
  • Gödel machines: self-referential universal problem solvers making provably optimal self-improvements
    (2006), pp. 119-226.
    by J Schmidhuber
    edited by B Goertzel, C Pennachin
    posted to gagliolo-phd printed algorithmic-complexity universal-search by gagliol on 2007-12-20 14:02:57 as read
  • Bounded Conditioning: Flexible Inference for Decisions Under Scarce Resources
    (1989), pp. 182-193.
    by Eric J Horvitz, Jacques H Suermondt, Gregory F Cooper
    posted to gagliolo-phd printed anytime-algorithms time-quality-trade-off by gagliol on 2007-12-20 10:24:46 as **
  • Planning
    (2004), pp. 554-560.
    by Michail G Lagoudakis, Sven Koenig
    edited by Claude Ghaoui
    posted to gagliolo-phd planning printed by gagliol on 2007-12-18 17:05:48 as **
  • Automatic evaluation and selection of problem-solving methods: theory and experiments
    J. Exp. Theor. Artif. Intell., Vol. 16, No. 2. (2004), pp. 73-105.
    by Eugene Fink
    posted to gagliolo-phd offline planning printed restart censored-sampling survival-analysis algorithm-selection performance-modeling by gagliol on 2007-12-18 15:02:28 as ** along with 1 person bsilverthorn
  • How to Solve It Automatically: Selection Among Problem Solving Methods
    (1998), pp. 128-136.
    by Eugene Fink
    posted to gagliolo-phd offline planning printed restart censored-sampling survival-analysis algorithm-selection performance-modeling by gagliol on 2007-12-17 18:42:34 as *** along with 1 person bsilverthorn
  • Markov Decision Processes: Discrete Stochastic Dynamic Programming
    (15 April 1994)
    by Martin L Puterman
    posted to gagliolo-phd dynamic-programming mdp markov-decision-process reinforcement-learning by gagliol on 2007-12-17 17:50:48 as *
  • Learning to select branching rules in the dpll procedure for satisfiability
    Vol. 9 (2001), pp. 344-359.
    by M Lagoudakis, M Littman
    posted to gagliolo-phd printed algorithm-selection reinforcement-learning by gagliol on 2007-12-17 15:07:23 as ***
  • Learning dynamic algorithm portfolios
    Annals of Mathematics and Artificial Intelligence, Vol. 47, No. 3-4. (August 2006), pp. 295-328.
    by Matteo Gagliolo, Jürgen Schmidhuber
    posted to parallel-computing algorithm-portfolios computational-complexity algorithm-selection combinatorial-auctions combinatorial-optimization constraint-satisfaction runtime-distributions survival-analysis bandit conditional gagliolo-phd satisfiability by gagliol on 2007-12-16 11:55:24 as ** along with 1 person bsilverthorn
  • Boosting Verification by Automatic Tuning of Decision Procedures
    (2007)
    by F Hutter, D Babic, HH Hoos, Hu
    posted to gagliolo-phd printed algorithm-selection parameter-tuning by gagliol on 2007-12-14 18:52:11 as **
  • Automatic Algorithm Configuration based on Local Search
    (2007), pp. 1152-1157.
    by F Hutter, HH Hoos, T Stützle
    posted to gagliolo-phd printed algorithm-selection by gagliol on 2007-12-14 18:43:42 as **
  • Understanding Random SAT: Beyond the Clauses-to-Variables Ratio
    Vol. 3258 (2004), pp. 438-452.
    by Eugene Nudelman, Kevin Leyton-Brown, Holger H Hoos, Alex Devkar, Yoav Shoham
    edited by Mark Wallace
    posted to gagliolo-phd printed algorithm-selection by gagliol on 2007-12-14 18:19:07 as **
  • Boosting as a metaphore for algorithm design
    (2003)
    by Kevin Leyton-Brown, Eugene Nudelman, Galen Andrew, Jim Mcfadden, Yoav Shoham
    posted to gagliolo-phd printed algorithm-selection by gagliol on 2007-12-14 18:15:12 as **
  • Boosting as a Metaphor for Algorithm Design
    Vol. 2833 (2003), pp. 899-903.
    by Kevin Leyton-Brown, Eugene Nudelman, Galen Andrew, Jim Mcfadden, Yoav Shoham
    edited by Francesca Rossi
    posted to gagliolo-phd printed algorithm-selection by gagliol on 2007-12-14 18:05:09 as **
  • Empirical Approach to the Complexity of Hard Problems
    (October 2005)
    by Eugene Nudelman
    posted to gagliolo-phd meta-learning algorithm-selection combinatorial-auctions combinatorial-optimization constraint-satisfaction by gagliol on 2007-12-14 17:59:03 as **
  • An Adaptive Algorithm Selection Framework
    (2004), pp. 278-289.
    by Hao Yu, Dongmin Zhang, Lawrence Rauchwerger
    posted to gagliolo-phd printed algorithm-selection by gagliol on 2007-12-14 17:25:08 as **
  • Performance Modeling for Dynamic Algorithm Selection
    Vol. 2660 (2003), pp. 749-758.
    by Michael O Mccracken, Allan Snavely, Allen D Malony
    edited by Peter MA Sloot, David Abramson, Alexander V Bogdanov, Jack Dongarra, Albert Y Zomaya, Yuri E Gorbachev, Peter MA Sloot, David Abramson, Alexander V Bogdanov, Jack Dongarra, Albert Y Zomaya, Yuri E Gorbachev
    posted to gagliolo-phd printed algorithm-selection grid-computing parallel-computing by gagliol on 2007-12-14 17:22:01 as **
  • Restart policies with dependence among runs: A dynamic programming approach
    Vol. 2470 (2002)
    by Y Ruan, E Horvitz, H Kautz
    edited by Pascal Van Hentenryck
    posted to bibtex-import-wt dynamic gagliolo-phd printed restart satisfiability by gagliol on 2007-03-23 17:47:01 as **
  • Dynamically adapting kernels in support vector machines
    Vol. 11 (1999), pp. 204-210.
    by N Cristianini, C Campbell, Shawe J Taylor
    edited by SA Solla, TK Leen, KR Müller
    posted to dynamic gagliolo-laurea gagliolo-phd printed svm meta-learning statistical-learning kernel-methods by gagliol on 2006-08-27 19:11:09 as read
  • Simple Rules for Low-Knowledge Algorithm Selection.
    (2004), pp. 50-64.
    by Christopher J Beck, Eugene C Freuder
    posted to gagliolo-phd printed algorithm-selection by gagliol on 2006-08-11 18:14:26 as **
  • Low Knowledge Algorithm Control
    (2004)
    by Tom Carchrae, Christopher J Beck
    posted to gagliolo-phd low-knowledge printed algorithm-selection by gagliol on 2006-08-11 18:09:15 as **
  • Applying Machine Learning to Low Knowledge Control of Optimization Algorithms
    Computational Intelligence, Vol. 21, No. 4. (2005), pp. 373-387.
    by T Carchrae, JC Beck
    edited by Seth
    posted to bayes gagliolo-phd printed static parallel-computing algorithm-portfolios dynamic-algorithm-portfolios algorithm-selection cost-profiles discrete-optimization job-schop-scheduling meta-learning randomized-algorithms by gagliol on 2006-08-11 17:55:11 as read
  • The search for Satisfaction
    (1999)
    by I Gent, T Walsh
    posted to gagliolo-phd satisfiability by gagliol on 2006-07-17 11:24:55 as **
  • notes Shifting inductive bias with success-story algorithm, adaptive Levin search, and incremental self-improvement
    Machine Learning, Vol. 28 (1997), pp. 105-130.
    by J Schmidhuber, J Zhao, M Wiering
    posted to gagliolo-phd algorithmic-complexity sips universal-search reinforcement-learning by gagliol on 2006-07-17 11:24:54 as **
  • Algorithm Selection using Reinforcement Learning
    (2000), pp. 511-518.
    by Michail G Lagoudakis, Michael L Littman
    edited by Pat Langley
    posted to gagliolo-phd printed algorithm-selection reinforcement-learning by gagliol on 2006-07-17 11:24:54 as **
  • Learning the Empirical Hardness of Optimization Problems: The Case of Combinatorial Auctions
    Vol. 2470 (2002), pp. 556-572.
    by Kevin Leyton-Brown, Eugene Nudelman, Yoav Shoham
    edited by Pascal Van Hentenryck
    posted to bibtex-import-wt gagliolo-phd printed algorithm-selection meta-learning performance-modeling by gagliol on 2006-07-17 11:24:54 as **
  • Computational Tradeoffs under Bounded Resources (Editorial)
    Artificial Intelligence, Vol. 126, No. 1--2. (2001), pp. 1-4.
    by Eric J Horvitz, Shlomo Zilberstein
    posted to gagliolo-phd bounded-rationality anytime-algorithms by gagliol on 2006-07-17 11:24:54 as **
  • Introduction to the Special Issue on Meta-Learning
    Machine Learning, Vol. 54, No. 3. (2004), pp. 187-193.
    by Christophe G Carrier, Ricardo Vilalta, Pavel Brazdil
    posted to gagliolo-phd meta-learning by gagliol on 2006-07-17 11:24:54 as **
  • Ranking Learning Algorithms: Using IBL and Meta Learning on Accuracy and Time Results
    Machine Learning, Vol. 50, No. 3. (2003), pp. 251-277.
    by Pavel B Brazdil, Carlos Soares, Joaquim P da Costa
    posted to gagliolo-phd ranking meta-learning by gagliol on 2006-07-17 11:24:53 as **
    • ◇温馨提示◇本页的引用地址为： http://www.citeulike.org/user/gagliol/tag/gagliolo-phd

    RIS BibTeX RSS
    CiteULike organises scholarly (or academic) papers or literature and provides bibliographic (which means it makes bibliographies) for universities and higher education establishments. It helps undergraduates and postgraduates. People studying for PhDs or in postdoctoral (postdoc) positions. The service is similar in scope to EndNote or RefWorks or any other reference manager like BibTeX, but it is a social bookmarking service for scientists and humanities researchers.