Регистрация | Вход в службу | FAQ      [?] 

Ключевое слово algorithm-selection [44 articles]

Recent papers classified by the tag algorithm-selection.
  • A Portfolio Approach to Algorithm Selection
    by Kevin L Brown, Eugene Nudelman, Galen Andrew, Jim Mcfadden, Yoav Shoham
  • On-line Choice of On-line Algorithms
    (1993)
    posted to algorithm-selection online online-algorithm by scis0000001 on 2006-10-06 10:00:08 as **
  • Statistical Regimes across Constrainedness Regions
    by Carla P Gomes, Cesar Fernandez, Bart Selman, Christian Bessiere
    posted to algorithm-selection power-law randomness searching by scis0000001 on 2006-11-15 13:43:42 as **
  • A neural network model for inter-problem adaptive online time allocation
    (2005)
    posted to algorithm-selection automating by scis0000001 on 2006-11-15 13:39:24 as **
  • Dynamic Algorithm Portfolios
    by Matteo G And
  • High-level optimization via automated statistical modeling
    (1995), pp. 80-91.
    by Eric A Brewer
  • GAUSS: an online algorithm selection system for numerical quadrature
    (January 2002), pp. 27-36.
  • Algorithm selection: a quantitative computation-intensive optimization approach
    (1994), pp. 90-95.
    by Miodrag Potkonjak, Jan Rabaey
  • An automatic selection method and its application to key search algorithms
    Inf. Sci. Inf. Comput. Sci., Vol. 85, No. 1-3. (1995), pp. 127-146.
    by Ki-Hong Park, Jun-Ichi Aoe, Masamie Shishibori, Yoshi-Taka Hayashi
  • Future problem solving environments for computational science
    (2002), pp. 93-114.
    by Elias N Houstis, John R Rice
  • Recursive automatic bias selection for classifier construction
    Machine Learning, Vol. V20, No. 1. (1 July 1995), pp. 63-94.
    by Carla E Brodley
  • 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
  • Learning parallel portfolios of algorithms
    Annals of Mathematics and Artificial Intelligence, Vol. 48, No. 1-2. (September 2006), pp. 85-106.
    by Marek Petrik, Shlomo Zilberstein
  • 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
  • Efficient Algorithms for Minimizing Cross Validation Error
    (1994), pp. 190-198.
    by Andrew W Moore, Mary S Lee
  • Optimal Schedules for Parallelizing Anytime Algorithms
    (2001), pp. 49-56.
    by Lev Finkelstein, Shaul Markovitch, Ehud Rivlin
  • PYTHIA-II: a knowledge/database system for managing performance data and recommending scientific software
    TOMS, Vol. 26, No. 2. (2000), pp. 227-253.
    by Elias N Houstis, Ann C Catlin, John R Rice, Vassilios S Verykios, Naren Ramakrishnan, Catherine E Houstis
    posted to algorithm-selection by gagliol on 2006-10-07 13:04:40 as **
  • Parallel trials versus single search in supervised learning
    Artificial Neural Networks, 1991., Second International Conference on (1991), pp. 24-28.
    by M Muselli, M Rabbia
    edited by O Simula
  • Nonsystematic Backtracking Search
    (1995)
    by William D Harvey
  • How to Solve It Automatically: Selection Among Problem Solving Methods
    (1998), pp. 128-136.
    by Eugene Fink
  • 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 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 **
  • Learning to select branching rules in the dpll procedure for satisfiability
    Vol. 9 (2001), pp. 344-359.
    posted to gagliolo-phd printed algorithm-selection reinforcement-learning by gagliol on 2007-12-17 15:07:23 as ***
  • Algorithm portfolios
    Artif. Intell., Vol. 126, No. 1-2. (2001), pp. 43-62.
    by Carla P Gomes, Bart Selman
  • Modeling GA Performance for Control Parameter Optimization
    (October-December 2000), pp. 235-242.
    by Stephen F Smith, Vincent A Cicirello
    edited by Darrell Whitley, David Goldberg, Erick C Paz, Lee Spector, Ian Parmee, Hans G Beyer
  • notes Boosting Stochastic Problem Solvers through Online Self-Analysis of Performance
    (July 2003)
    by Vincent A Cicirello
    posted to algorithm-selection by gagliol on 2006-08-14 20:00:00 as *** along with 1 person scis0000001
  • Provably bounded optimal agents
    (~FebruarySeptember--~March 1993), pp. 338-344.
    edited by Ruzena Bajcsy
    posted to algorithm-selection anytime-algorithms by gagliol on 2007-12-18 15:24:18 as **
  • Knowledge-Based Anytime Computation
    (1995), pp. 775-783.
    by Abdel I Mouaddib, Shlomo Zilberstein
    posted to algorithm-selection anytime-algorithms by gagliol on 2007-12-18 15:22:31 as **
  • Automatically Configuring Constraint Satisfaction Programs: A Case Study
    Constraints, Vol. 1, No. 1/2. (1996), pp. 7-43.
    by Steven Minton
    posted to satisfiability algorithm-selection by gagliol on 2007-12-18 15:21:13 as **
  • Optimal Schedules for Parallelizing Anytime Algorithms: The Case of Shared Resources
    Journal of Artificial Intelligence Research, Vol. 19 (2003), pp. 73-138.
    by Lev Finkelstein, Shaul Markovitch, Ehud Rivlin
  • The adaptive constraint engine
    (2002)
    posted to dynamic dynamic-algorithm-portfolios algorithm-selection by gagliol on 2006-10-22 21:08:23 as **
  • Adaptive Constraint Satisfaction: The Quickest First Principle
    (1996), pp. 160-164.
    by JE Borrett, Edward PK Tsang, NR Walsh
  • Learning Static Parallel Portfolios of Algorithms
    (January 2006)
    by Marek Petrik, Shlomo Zilberstein
  • Reasoning under varying and uncertain resource constraints
    (1988), pp. 111-116.
    by Eric J Horvitz
    posted to algorithm-selection by gagliol on 2007-12-18 15:14:55 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 **
  • Selecting the right algorithm
    (2001)
    edited by Carla Gomes, Toby Walsh
    posted to dynamic printed algorithm-selection reinforcement-learning by gagliol on 2007-12-13 16:32:56 as **
  • Reinforcement Learning for Algorithm Selection
    (2000)
    by Michail G Lagoudakis, Michael L Littman
    posted to algorithm-selection reinforcement-learning by gagliol on 2007-12-17 15:26:55 as **
  • Ideal reformulation of belief networks
    (1991), pp. 129-144.
    by Jack S Breese, Eric Horvitz
    posted to algorithm-selection by gagliol on 2007-12-18 15:06:05 as **
  • Approximate and Compensate: A method for risk-sensitive meta-deliberation and continual computation
    (2001)
    by David Parkes, LG Greenwald
  • Combining Multiple Heuristics Online
    (2007), pp. 1197-1203.
    by Matthew J Streeter, Daniel Golovin, Stephen F Smith
  • 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
  • Parallel speed-up of Monte Carlo methods for global optimization
    J. Complex., Vol. 10, No. 1. (March 1994), pp. 64-95.
  • A Parallelization Scheme Based on Work Stealing for a Class of SAT Solvers
    Journal of Automated Reasoning, Vol. 34, No. 1. (January 2005), pp. 73-101.
    by Bernard Jurkowiak, Chu Li, Gil Utard
  • Вы можете ссылаться на эту страницу по адресу: http://www.citeulike.org/tag/algorithm-selection

    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.