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

bsilverthorn's library [142 articles]

最近录入 bsilverthorn's 文献库.
  • Failure of intuition in elementary rigid body dynamics
    (10 Jan 2008)
    by Nivaldo A Lemos
    posted to rigid_body physics by bsilverthorn on 2008-07-11 22:10:13 as read
  • Exploration exploitation in Go: UCT for Monte-Carlo Go
    Twentieth Annual Conference on Neural Information Processing Systems (NIPS 2006) (2006)
    by Sylvain Gelly, Yizao Wang
    posted to uct monte_carlo go by bsilverthorn on 2008-07-01 17:07:03 as read
  • 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 **
  • Applying Machine Learning to Low-Knowledge Control of Optimization Algorithms
    Computational Intelligence, Vol. 21, No. 4. (November 2005), pp. 372-387.
    by Tom Carchrae, Christopher J Beck
    posted to low_knowledge algorithm_portfolios by bsilverthorn on 2008-04-23 19:26:49 as read
  • Restart Policies with Dependence among Runs: A Dynamic Programming Approach
    Principles and Practice of Constraint Programming - CP 2002 (2002), pp. 175-200.
    by Yongshao Ruan, Eric Horvitz, Henry Kautz
    posted to restart_strategies dynamic_programming by bsilverthorn on 2008-04-23 17:12:22 as read
  • Randomization and Restart Strategies
    (2006)
    by Huayue Wu
    posted to satisfiability restart_strategies phd_theses by bsilverthorn on 2008-04-23 17:02:25 as read
  • Dynamic restart policies
    (2002), pp. 674-681.
    by Henry Kautz, Eric Horvitz, Yongshao Ruan, Carla Gomes, Bart Selman
    posted to satisfiability restart_strategies by bsilverthorn on 2008-04-23 17:02:00 as read
  • Learning the Empirical Hardness of Optimization Problems: The Case of Combinatorial Auctions
    Principles and Practice of Constraint Programming - CP 2002 (2002), pp. 91-100.
    by Kevin Leyton-Brown, Eugene Nudelman, Yoav Shoham
    posted to empirical_hardness algorithm_behavior by bsilverthorn on 2008-04-23 03:19:11 as read
  • 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)
    by G Syswerda
    edited by Gregory JE Rawlins
    posted to steady_state genetic_algorithms by bsilverthorn on 2008-04-22 21:25:01 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 ***
  • 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 **
  • A new approach to linear filtering and prediction problems
    Journal of Basic Engineering, Vol. 82, No. 1. (1960), pp. 35-45.
    by Rudolf E Kalman
    posted to kalman_filters by bsilverthorn on 2008-04-16 02:26:04 as read
  • Intelligence without representation
    Artificial Intelligence, Vol. 47 (1991), pp. 139-159.
    by Rodney A Brooks
    posted to robotics seminal by bsilverthorn on 2008-03-20 23:15:50 as read
  • 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 **
  • notes Using Confidence Bounds for Exploitation-Exploration Trade-offs
    The Journal of Machine Learning Research, Vol. 3 (2003), pp. 397-422.
    by Peter Auer
    posted to adaptive_adversarial bandit_problem confidence_bounds exploitation_exploration by bsilverthorn on 2008-03-19 14:46:09 as read
  • The Multiplicative Weights Update Method: a Meta Algorithm and Applications
    (2005)
    by Sanjeev Arora, Elad Hazan, Satyen Kale
    posted to meta_algorithms multiplicative_weights by bsilverthorn on 2008-03-18 21:37:50 as read
  • 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 **
  • Using upper confidence bounds for online learning
    Foundations of Computer Science, 2000. Proceedings. 41st Annual Symposium on (2000), pp. 270-279.
    by Peter Auer
    posted to adversarial bandit_problem confidence_bounds online_learning by bsilverthorn on 2008-03-14 03:11:15 as read
  • Robbing the bandit: less regret in online geometric optimization against an adaptive adversary
    (2006), pp. 937-943.
    by Varsha Dani, Thomas P Hayes
    posted to adversarial bandit_problem online_algorithms by bsilverthorn on 2008-03-14 03:08:26 as read along with 1 person gagliol
  • How to Beat the Adaptive Multi-Armed Bandit
    Arxiv preprint cs.DS/0602053 (2006)
    by Varsha Dani, Thomas P Hayes
    posted to adversarial bandit_problem by bsilverthorn on 2008-03-14 03:02:13 as read
  • On Following the Perturbed Leader in the Bandit Setting
    Algorithmic Learning Theory (2005), pp. 371-385.
    by Jussi Kujala, Tapio Elomaa
    posted to bandit_problem perturbed_leader by bsilverthorn on 2008-03-13 16:09:23 as read
  • Adaptive Treatment Allocation and the Multi-Armed Bandit Problem
    The Annals of Statistics, Vol. 15, No. 3. (1987), pp. 1091-1114.
    by Tze L Lai
    posted to bandit_problem classic treatment_allocation by bsilverthorn on 2008-03-12 17:34:13 as read
  • Finite-time Analysis of the Multiarmed Bandit Problem
    Machine Learning, Vol. 47, No. 2. (1 May 2002), pp. 235-256.
    by Peter Auer, Nicolò Cesa-Bianchi, Paul Fischer
    posted to bandit_problem finite_time by bsilverthorn on 2008-03-12 17:30:52 as *
  • An Asymptotically Optimal Algorithm for the Max k-Armed Bandit Problem
    (2006)
    by Matthew J Streeter, Stephen F Smith
    posted to bandit_problem extreme_values max_bandit by bsilverthorn on 2008-03-12 16:13:36 as read
  • A Simple Distribution-Free Approach to the Max k-Armed Bandit Problem
    Principles and Practice of Constraint Programming - CP 2006 (2006), pp. 560-574.
    by Matthew J Streeter, Stephen F Smith
    posted to bandit_problem max_bandit by bsilverthorn on 2008-03-12 15:58:37 as read
  • The Max K-Armed Bandit: A New Model for Exploration Applied to Search Heuristic Selection
    (2005)
    by Vincent Cicirello, Stephen Smith
    posted to algorithm_portfolios bandit_problem extreme_values heuristic_search max_bandit by bsilverthorn on 2008-03-12 15:53:02 as read
  • 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 **
  • Adaptive Routing with End-to-End Feedback: Distributed Learning and Geometric Approaches
    (2004), pp. 45-53.
    by Baruch Awerbuch, Robert D Kleinberg
    posted to adaptive_routing bandit_problem linear_optimization online_algorithms partial_information perturbed_leader by bsilverthorn on 2008-03-11 23:09:41 as read
  • Efficient algorithms for online decision problems
    Journal of Computer and System Sciences, Vol. 71, No. 3. (October 2005), pp. 291-307.
    by Adam Kalai, Santosh Vempala
    posted to full_information online_algorithms perturbed_leader by bsilverthorn on 2008-03-11 21:39:42 as read
  • Following the Perturbed Leader to Gamble at Multi-armed Bandits
    Algorithmic Learning Theory (2007), pp. 166-180.
    by Jussi Kujala, Tapio Elomaa
    posted to adversarial bandit_problem partial_information perturbed_leader by bsilverthorn on 2008-03-11 21:31:26 as read
  • A Decision-Theoretic Generalization of On-Line Learning and an Application to Boosting
    Journal of Computer and System Sciences, Vol. 55, No. 1. (1997), pp. 119-139.
    by Yoav Freund, Robert E Schapire
    posted to best_expert boosting learning_theory online_learning by bsilverthorn on 2008-03-11 16:03:16 as read
  • The Weighted Majority Algorithm
    30th Annual Symposium on Foundations of Computer Science (1989), pp. 256-261.
    by Nick Littlestone, Manfred K Warmuth
    posted to best_expert learning_theory online_learning by bsilverthorn on 2008-03-09 23:04:35 as read along with 1 person davidr
  • Tracking the Best Expert
    Machine Learning, Vol. 32, No. 2. (1998), pp. 151-178.
    by Mark Herbster, Manfred Warmuth
    posted to best_expert by bsilverthorn on 2008-03-09 23:01:59 as read
  • 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 Learning and the Metrical Task System Problem
    Machine Learning, Vol. 39, No. 1. (1 April 2000), pp. 35-58.
    by Avrim Blum, Carl Burch
    posted to metrical_tasks online_algorithms online_learning best_expert by bsilverthorn on 2008-03-09 20:01:10 as read
  • 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 **
  • 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 ***
  • Gambling in a rigged casino: the adversarial multi-armed bandit problem
    (1995), pp. 322-331.
    by Peter Auer, Nicolò C Bianchi, Yoav Freund, Robert E Schapire
    posted to adversarial bandit_problem partial_information by bsilverthorn on 2008-03-08 21:57:06 as read
  • 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 **
  • The best expert versus the smartest algorithm
    Theoretical Computer Science, Vol. 324, No. 2-3. (20 September 2004), pp. 361-380.
    by Peter Chen, Guoli Ding
    posted to best_expert by bsilverthorn on 2008-03-07 00:39:01 as read
  • 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
    posted to learning_theory statistical_learning by bsilverthorn on 2008-03-05 16:15:29 as ** along with 1 person jsr
  • Search Space Features Underlying the Performance of Stochastic Local Search Algorithms for MAX-SAT
    Parallel Problem Solving from Nature - PPSN VIII (2004), pp. 51-60.
    by Holger H Hoos, Kevin Smyth, Thomas Stützle
    posted to local_search max_sat performance_prediction by bsilverthorn on 2008-03-05 00:16:27 as read
  • Correlated and uncorrelated fitness landscapes and how to tell the difference
    Biological Cybernetics, Vol. 63, No. 5. (1990), pp. 325-336.
    by Edward Weinberger
    posted to correlation_length fitness_landscapes by bsilverthorn on 2008-03-05 00:14:12 as read
  • NK fitness landscapes
    Handbook of Evolutionary Computation, Vol. 2 (1997)
    by Lee Altenberg
    posted to fitness_landscapes genetic_algorithms nk_landscapes by bsilverthorn on 2008-03-04 23:41:51 as read
    • ◇温馨提示◇本页的引用地址为： http://www.citeulike.org/user/bsilverthorn

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