新規登録 | ログイン | FAQ      [?] 
Recent | Unread | Search | Authors | Tags | Export

bsilverthorn library [142 articles]

最近 bsilverthorn さんのライブラリ (優先度順).
  • Parameter adjustment based on performance prediction: Towards an instance-aware problem solver
    (December 2005)
    by Frank Hutter, Youssef Hamadi
  • Discovering Solutions with Low Kolmogorov Complexity and High Generalization Capability
    (1995), pp. 488-496.
    by Jurgen Schmidhuber
    posted to kolmgorov_complexity levin_search machine_learning by bsilverthorn on 2007-11-09 22:01:24 as ****
  • Generation gaps revisited
    Foundations of Genetic Algorithms, Vol. 2 (1993), pp. 19-28.
    by Kenneth A De Jong, Jayshree Sarma
    posted to steady_state genetic_algorithms generation_gaps by bsilverthorn on 2008-04-22 21:22:34 as ***
  • Minimizing Regret with Label Efficient Prediction
    Learning Theory: 17th Annual Conference on Learning Theory, COLT 2004, Banff, Canada, July 1-4, 2004: Proceedings (2004)
    by Nicolò Cesa-Bianchi, Gábor Lugosi, Gilles Stoltz
    posted to label_efficient best_expert by bsilverthorn on 2008-03-08 22:05:54 as ***
  • Provably Bounded-Optimal Agents
    Journal of Artificial Intelligence Research, Vol. 2 (May 1995), pp. 575-609.
    by Stuart Russell, Devika Subramanian
    posted to bounded_optimality seminal by bsilverthorn on 2008-01-21 16:48:28 as ***
  • No more lunch: analysis of sequential search
    Evolutionary Computation, 2004. CEC2004. Congress on, Vol. 1 (2004), pp. 227-234 Vol.1.
    by Tom English
    posted to no_free_lunch by bsilverthorn on 2007-12-04 20:13:42 as ***
  • Steps toward Artificial Intelligence
    Proceedings of the IRE, Vol. 49, No. 1. (1961), pp. 8-30.
    by Marvin Minsky
    posted to seminal survey by bsilverthorn on 2007-12-03 23:41:28 as ***
  • Toward Efficient Agnostic Learning
    (1992), pp. 341-352.
    by Michael J Kearns, Robert E Schapire, Linda Sellie
  • Bandit Algorithms for Tree Search
    (13 Mar 2007)
    by Pierre-Arnaud Coquelin, Rémi Munos
    posted to bandit_problem tree_search by bsilverthorn on 2007-11-13 20:34:03 as *** along with 1 person sato-ryu
  • Evolvability
    Mathematical Foundations of Computer Science 2007 (2007), pp. 22-43.
    by Leslie Valiant
    posted to evolution evolvability by bsilverthorn on 2007-11-12 20:52:01 as ***
  • Do the right thing: studies in limited rationality
    (1991)
    by Stuart Russell, Eric Wefald
    posted to bounded_optimality by bsilverthorn on 2007-11-05 20:57:34 as ***
  • Theoretical impediments to artificial intelligence
    Information Processing (1974), pp. 615-619.
    by Michael O Rabin
    posted to classic by bsilverthorn on 2008-04-26 00:19:09 as **
  • Performance Prediction and Automated Tuning of Randomized and Parametric Algorithms
    Principles and Practice of Constraint Programming - CP 2006 (2006), pp. 213-228.
    by Frank Hutter, Youssef Hamadi, Holger Hoos, Kevin Leyton-Brown
    posted to performance_prediction parameter_adjustment by bsilverthorn on 2008-04-24 01:55:50 as **
  • On Portfolios for Backtracking Search in the Presence of Deadlines
    Tools with Artificial Intelligence, 2007. ICTAI 2007. 19th IEEE International Conference on, Vol. 1 (2007), pp. 231-238.
    by Huayue Wu, Peter van Beek
    posted to deadlines complete_search algorithm_portfolios by bsilverthorn on 2008-04-24 01:55:14 as **
  • Adaptation in Natural and Artificial Systems
    (1975)
    by John H Holland
    posted to genetic_algorithms classic by bsilverthorn on 2008-04-22 21:35:19 as **
  • A Study of Reproduction in Generational and Steady-State Genetic Algorithms
    Foundations of Genetic Algorithms (1991)
    edited by Gregory JE Rawlins
    posted to steady_state genetic_algorithms by bsilverthorn on 2008-04-22 21:25:01 as **
  • Approximation to Bayes risk in repeated plays
    Contributions to the Theory of Games, Vol. 3 (1957), pp. 97-139.
    by James Hannan
    edited by M Dresher, AW Tucker, P Wolfe
    posted to best_expert game_theory seminal by bsilverthorn on 2008-04-17 23:15:41 as **
  • From External to Internal Regret
    The Journal of Machine Learning Research, Vol. 8 (2007), pp. 1307-1324.
    by Avrim Blum, Yishay Mansour
    posted to bandit_problem internal_regret by bsilverthorn on 2008-03-19 15:56:19 as **
  • An Approach to Bounded Rationality
    (2007)
    by Eli Ben-Sasson, Adam T Kalai, Ehud Kalai
    posted to bounded_rationality game_theory nash_equilibria by bsilverthorn on 2008-03-19 15:37:34 as **
  • The Nonstochastic Multiarmed Bandit Problem
    SIAM Journal on Computing, Vol. 32, No. 1. (2002), pp. 48-77.
    by Peter Auer, Nicolò C Bianchi, Yoav Freund, Robert E Schapire
    posted to bandit_problem survey worst_case by bsilverthorn on 2008-03-17 16:33:15 as **
  • Efficient Algorithms for Universal Portfolios
    Journal of Machine Learning Research, Vol. 3, No. 3. (April 2003), pp. 423-441.
    by Adam Kalai, Santosh Vempala
    posted to market_portfolios random_walks by bsilverthorn on 2008-03-12 00:30:12 as **
  • Multi-Armed Bandits in Metric Spaces
    (May 2008)
    by Robert Kleinberg, Aleksandrs Slivkins, Eli Upfal
    posted to bandit_problem online_algorithms by bsilverthorn on 2008-03-11 23:14:20 as **
  • Asymptotically efficient adaptive allocation rules
    Advances in Applied Mathematics, Vol. 6, No. 1. (1985), pp. 4-22.
    by Tze L Lai, Herbert Robbins
    posted to allocation_rules by bsilverthorn on 2008-03-09 22:29:31 as **
  • Online computation and competitive analysis
    (1998)
    by Allan Borodin, Ran El-Yaniv
    posted to online_algorithms by bsilverthorn on 2008-03-09 20:04:03 as **
  • On-line choice of on-line algorithms
    (1993), pp. 432-440.
    by Yossi Azar, Andrei Z Broder, Mark S Manasse
    posted to metrical_tasks online_algorithms by bsilverthorn on 2008-03-09 19:52:27 as **
  • Master Algorithms for Active Experts Problems based on Increasing Loss Values
    Arxiv preprint cs.LG/0502067 (2005)
    by Jan Poland, Marcus Hutter
    posted to active_experts bandit_problem best_expert by bsilverthorn on 2008-03-08 21:27:17 as **
  • On the Mathematical Foundations of Learning
    Bulletin of the American Mathematical Society, Vol. 39, No. 1. (2002), pp. 1-49.
    by Felipe Cucker, Steve Smale
  • Theory and applications of Robust Optimization
    (2007)
    by Dimitris Bertsimas, David B Brown, Constantine Caramanis
    posted to robust_optimization survey by bsilverthorn on 2008-02-27 22:20:01 as **
  • Beyond PAC: A Robust Optimization Approach for Learning in the Presence of Noise
    (2007)
    by Constantine Caramanis, Shie Mannor
  • Contrasting Structured and Random Permutation Flow-Shop Scheduling Problems: Search Space Topology and Algorithm Performance
    INFORMS Journal on Computing, Vol. 14, No. 2. (2002), pp. 98-123.
    by Jean-Paul Watson, Laura Barbulescu, Darrell L Whitley, Adele E Howe
    posted to algorithm_behavior shop_scheduling by bsilverthorn on 2008-02-10 17:29:17 as **
  • A Dynamic Model of Tabu Search for the Job-Shop Scheduling Problem
    Proc. of the 1st Multidisciplinary Int. Conf. on Scheduling: Theory and Applications, pp. 320-336.
    by Jean-Paul Watson, Darrell L Whitley, Adele E Howe
    posted to algorithm_behavior shop_scheduling tabu_search by bsilverthorn on 2008-02-10 17:25:54 as **
  • notes Combining Multiple Heuristics
    STACS 2006 (2006), pp. 242-253.
    by Tzur Sayag, Shai Fine, Yishay Mansour
    posted to algorithm_portfolios pac_bounds by bsilverthorn on 2008-02-01 00:01:30 as **
  • Using decision procedures efficiently for optimization
    Proceedings of the Seventeenth International Conference on Automated Planning and Scheduling (2007), pp. 312-319.
    by Matthew Streeter, Stephen F Smith
    posted to decision_problems planning query_strategies by bsilverthorn on 2008-01-31 23:50:57 as **
  • Progress in incremental machine learning
    (2003)
    by Ray Solomonoff
    posted to machine_learning by bsilverthorn on 2008-01-27 06:33:44 as ** along with 1 person scis0000001
  • Shifting Inductive Bias with Success-Story Algorithm, Adaptive Levin Search, and Incremental Self-Improvement
    Machine Learning, Vol. 28, No. 1. (1 July 1997), pp. 105-130.
    by Jürgen Schmidhuber, Jieyu Zhao, Marco Wiering
    posted to levin_search success-story by bsilverthorn on 2008-01-27 06:31:13 as **
  • Using Online Algorithms to Solve NP-Hard Problems More Efficiently in Practice
    (December 2007)
    by Matthew Streeter
    posted to algorithm_portfolios online_algorithms phd_theses by bsilverthorn on 2008-01-27 06:26:20 as **
  • Monitoring and control of anytime algorithms: A dynamic programming approach
    Artificial Intelligence, Vol. 126, No. 1-2. (February 2001), pp. 139-157.
    by Eric A Hansen, Shlomo Zilberstein
    posted to anytime_algorithms dynamic_programming by bsilverthorn on 2008-01-27 06:18:42 as **
  • The Algorithm Selection Problem
    Advances in Computers, Vol. 15 (1976), pp. 65-118.
    by JR Rice
    posted to algorithm_selection classic by bsilverthorn on 2008-01-27 02:51:46 as **
  • Reinforcement learning for active model selection
    (2005), pp. 17-23.
    by Aloak Kapoor, Russell Greiner
    posted to model_selection reinforcement_learning by bsilverthorn on 2008-01-25 17:48:16 as **
  • Adaptive Online Time Allocation to Search Algorithms
    Machine Learning: ECML 2004 (2004), pp. 134-143.
    by Matteo Gagliolo, Viktor Zhumatiy, Jürgen Schmidhuber
    posted to algorithm_portfolios genetic_algorithms by bsilverthorn on 2008-01-21 21:15:37 as **
  • Applying machine learning to low-knowledge control of optimization algorithms
    Computational Intelligence, Vol. 21, No. 4. (2005), pp. 372-387.
    by Tom Carchrae, JC Beck
    posted to algorithm_portfolios machine_learning by bsilverthorn on 2008-01-21 20:55:46 as **
  • Online Selection, Adaptation, and Hybridization of Algorithms
    (November 2006)
    by Matthew J Streeter
  • Optimal schedules for parallelizing anytime algorithms: the case of independent processes
    (2002), pp. 719-724.
    by Lev Finkelstein, Shaul Markovitch, Ehud Rivlin
  • A general agnostic active learning algorithm
    posted to active_learning agnostic_learning learning_theory by bsilverthorn on 2007-12-23 00:23:58 as **
  • A theory of the learnable
    Communications of the ACM, Vol. 27, No. 11. (November 1984), pp. 1134-1142.
    by Leslie G Valiant
  • The Computational Complexity of Machine Learning
    (1990)
    by Michael J Kearns
  • The complexity of theorem-proving procedures
    (1971), pp. 151-158.
    by Stephen A Cook
  • Heuristics: intelligent search strategies for computer problem solving
    (1984)
    by Judea Pearl
    posted to classic heuristic_search by bsilverthorn on 2007-11-30 23:10:31 as ** along with 1 person xiaoyan2006
  • Planning with predictive state representations
    Machine Learning and Applications, 2004. Proceedings. 2004 International Conference on (2004), pp. 304-311.
    by MR James, S Singh, ML Littman
    posted to predictive_state reinforcement_learning by bsilverthorn on 2007-11-26 23:39:05 as **
  • Predictive representations of state
    Advances in Neural Information Processing Systems, Vol. 14 (2002), pp. 1555-1561.
    by M Littman, R Sutton, S Singh
  • 注: このページを引用する時は次のURLでどうぞ: http://www.citeulike.org/user/bsilverthorn/order/to_read

    Result page: 1 2 Next 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.