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

gagliol's library [558 articles]

最近录入 gagliol's 文献库:按阅读优先等级排序.
  • A Theoretical Approach to Restart in Global Optimization
    Journal of Global Optimization, Vol. 10, No. 1. (1 January 1997), pp. 1-16.
    by Marco Muselli
    posted to optimization restart by gagliol on 2007-03-23 19:43:13 as *****
  • Solving Time-Dependent Planning Problems
    (1989), pp. 979-984.
    by Mark S Boddy, Thomas Dean
    posted to planning printed time-dependent-planning by gagliol on 2007-12-13 18:21:59 as ****
  • Planning under Time Constraints in Stochastic Domains
    Artif. Intell., Vol. 76, No. 1-2. (1995), pp. 35-74.
    by Thomas Dean, Leslie P Kaelbling, Jak Kirman, Ann E Nicholson
    posted to planning printed anytime-algorithms by gagliol on 2007-12-13 18:02:31 as ****
  • Solving Stochastic Planning Problems with Large State and Action Spaces
    (1998), pp. 102-110.
    by Thomas Dean, Robert Givan, Kee E Kim
    posted to planning stochastic-planning by gagliol on 2007-12-13 17:53:48 as ****
  • Decision-Theoretic Planning: Structural Assumptions and Computational Leverage
    J. Artif. Intell. Res. (JAIR), Vol. 11 (1999), pp. 1-94.
    by Craig Boutilier, Thomas Dean, Steve Hanks
    posted to planning anytime-algorithms by gagliol on 2007-12-13 17:48:42 as ****
  • Optimal Sequencing of Contract Algorithms
    by Shlomo Zilberstein, Fran\ccois Charpillet, Philippe Chassaing
    posted to contracts anytime-algorithms by gagliol on 2007-12-13 16:41:31 as ****
  • Real-Time Problem-Solving with Contract Algorithms
    (1999), pp. 1008-1015.
    by Shlomo Zilberstein, Francois Charpillet, Philippe Chassaing
    posted to ai contracts anytime-algorithms by gagliol on 2007-12-13 16:40:47 as ****
  • Scheduling contract algorithms on multiple processors
    (2002)
    by D Bernstein, T Perkins, S Zilberstein, L Finkelstein
    posted to ai contracts scheduling anytime-algorithms parallel-computing by gagliol on 2007-12-13 16:38:16 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
    posted to parallel-computing algorithm-portfolios algorithm-selection anytime-algorithms runtime-distributions by gagliol on 2007-07-06 15:04:41 as ****
  • Expected number of steps of a random optimization method
    Journal of Optimization Theory and Applications, Vol. 39, No. 2. (1 February 1983), pp. 165-171.
    by CCY Dorea
    posted to optimization randomized-algorithms performance-modeling by gagliol on 2007-03-23 19:50:54 as ****
  • An Analytic Evaluation of the Performance of the "Send and Wait" Protocol
    Communications, IEEE Transactions on [legacy, pre - 1988], Vol. 26, No. 3. (1978), pp. 313-319.
    by G Fayolle, E Gelenbe, G Pujolle
    posted to restart by gagliol on 2007-02-19 21:40:39 as ****
  • Competitive on-line learning with a convex loss function
    (2 Sep 2005)
    by Vladimir Vovk
    posted to bandit by gagliol on 2006-07-17 11:32:33 as **** along with 1 person davidr
  • 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
  • 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 ***
  • Combining Multiple Heuristics Online
    (2007), pp. 1197-1203.
    by Matthew J Streeter, Daniel Golovin, Stephen F Smith
    posted to bandit parallel-computing algorithm-portfolios algorithm-selection by gagliol on 2007-12-14 14:27:51 as ***
  • An Analysis of Time-Dependent Planning
    (1988), pp. 49-54.
    by Thomas Dean, Mark S Boddy
    edited by Tom M Mitchell, Reid G Smith
    posted to planning printed anytime-algorithms by gagliol on 2007-12-13 17:41:38 as ***
  • Q-Learning for Bandit Problems
    (1995), pp. 209-217.
    by Michael O Duff
    posted to bandit printed reinforcement-learning by gagliol on 2007-12-13 16:27:41 as ***
  • Learning Techniques for Automatic Algorithm Portfolio Selection.
    (2004), pp. 475-479.
    by Alessio Guerri, Michela Milano
    edited by Ramon L de Mántaras, Lorenza Saitta
    posted to parallel-computing algorithm-portfolios algorithm-selection by gagliol on 2007-07-06 15:18:45 as ***
  • An empirical study of learning speed in back-propagation networks
    No. Computer Science Technical Report. (1988)
    by Scott E Fahlman
    posted to optimization restart neural-networks nn performance-modeling by gagliol on 2007-03-29 18:31:57 as *** along with 1 person aarre
  • A methodology for managing risk in electronic transactions over the Internet
    Netnomics, Vol. 2, No. 1. (March 2000), pp. 25-36.
    by Rajan M Lukose, Bernardo A Huberman
    posted to restart by gagliol on 2007-03-22 16:22:05 as ***
  • Restart Strategies and Internet Congestion
    Journal of Economic Dynamics & Control, Vol. 25 (2001), pp. 641-654.
    by Sebastian M Maurer, Bernardo A Huberman
    posted to restart by gagliol on 2007-03-22 16:13:17 as ***
  • Multi-armed bandits in discrete and continuous time
    The Annals of Applied Probability, Vol. 8 (1998), pp. 1270-1290.
    by Haya Kaspi, Avishai Mandelbaum
    posted to bandit continuous-time by gagliol on 2007-03-06 13:04:55 as ***
  • Reinforcement Learning in Continuous Time and Space
    Neural Computation, Vol. 12, No. 1. (2000), pp. 219-245.
    by Kenji Doya
    posted to continuous-state continuous-time reinforcement-learning by gagliol on 2007-03-02 11:16:13 as ***
  • 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
  • The Nonstochastic Multiarmed Bandit Problem
    SIAM J. Comput., Vol. 32, No. 1. (2003), pp. 48-77.
    by Peter Auer, Nicol&\#242; Cesa-Bianchi, Yoav Freund, Robert E Schapire
    posted to bandit by gagliol on 2006-08-14 19:56:52 as ***
  • The Problem of Tuning Metaheuristics as Seen from a Machine Learning Perspective
    (2004)
    by M Birattari
    posted to metaheuristics racing meta-learning by gagliol on 2006-07-17 15:45:59 as ***
  • Optimal schedules for parallelizing anytime algorithms: the case of independent processes
    (2002), pp. 719-724.
    by Lev Finkelstein, Shaul Markovitch, Ehud Rivlin
    posted to algorithm-selection algorithm-portfolios parallel-computing anytime-algorithms by gagliol on 2006-07-17 11:24:55 as ***
  • Nonnegative Matrix Factorization in Polynomial Feature Space
    Neural Networks, IEEE Transactions on, Vol. 19, No. 6. (2008), pp. 1090-1100.
    by I Buciu, N Nikolaidis, I Pitas
    posted to pca matrix-factorization linear-algebra by gagliol on 2008-07-11 12:58:24 as ** along with 1 group IDSIA
  • Trashing the net: subcultural practice online
    (2002), pp. 150-163.
    by Mark Goodall
    posted to web multi-agent-systems cinema by gagliol on 2008-05-14 13:40:54 as **
  • Hierarchical structure and the prediction of missing links in networks
    Nature, Vol. 453, No. 7191., pp. 98-101.
    by Aaron Clauset, Cristopher Moore, MEJ Newman
    posted to social-networks networks linked-lists graph-theory complex-systems by gagliol on 2008-05-05 14:24:05 as ** along with 35 people sen_cheng jjray rds Borelli ptrobajo apwesolowski dpf cmmorel fbaroni balicea cmor kengg pbull jago Ema gtgt15 hryk nedwards i-stevenson pinney elsantosneto markusd eyliu craigwilson06 jyuh margaritis bryanhughes akshat tmmurali cactus AbnerCYH tny briordan deanmalmgren soramame_0518
  • 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 **
  • Algorithm Portfolio Design: Theory vs. Practice
    (August~January--March 1997), pp. 190-197.
    by Carla P Gomes, Bart Selman
    edited by Dan Geiger, Prakash P Shenoy
    posted to algorithm-portfolios algorithm-selection by gagliol on 2008-04-16 18:30:46 as ** along with 1 person and 2 groups roland_ewald dIEMoSIRIS MoSi-Rostock
  • What is coordination theory and how can it help design cooperative work systems?
    (1990), pp. 357-370.
    by Thomas W Malone, Kevin Crowston
    posted to coordination-theory by gagliol on 2008-04-10 14:34:46 as ** along with 1 person and 1 group pverstra macc
  • Generative communication in Linda
    ACM Trans. Program. Lang. Syst., Vol. 7, No. 1. (January 1985), pp. 80-112.
    by David Gelernter
    posted to distributed-computing linda tuple-spaces by gagliol on 2008-04-09 15:25:42 as ** along with 4 people saintedlama fheintz myui knud
  • Multiple tuple spaces in Linda
    PARLE '89 Parallel Architectures and Languages Europe (1989), pp. 20-27.
    by David Gelernter
    posted to distributed-computing linda tuple-spaces by gagliol on 2008-04-09 15:17:35 as **
  • Coordination languages: Back to the future with Linda
    (2005)
    by George Wells
    posted to no-tag by gagliol on 2008-04-08 20:11:57 as **
  • A Principled Semantics for inp
    (2000), pp. 51-65.
    by Jeremy L Jacob, Alan Wood
    posted to distributed-computing linda tuple-spaces by gagliol on 2008-04-08 17:22:12 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 Comparison of Evolution Strategies with Other Direct Search Methods in the Presence of Noise
    Comput. Optim. Appl., Vol. 24, No. 1. (2003), pp. 135-159.
    by Dirk V Arnold, Hans G Beyer
    posted to comparison evolutionary-computation evolution-strategies optimization search tutorial by gagliol on 2008-02-28 15:40:57 as **
  • A new mutation operator for evolution strategies for constrained problems
    Evolutionary Computation, 2005. The 2005 IEEE Congress on, Vol. 3 (2005), pp. 2600-2606 Vol. 3.
    by O Kramer, Chuan-Kang Ting, Hans K Buning
    posted to constrained-optimization evolutionary-computation evolution-strategies optimization printed by gagliol on 2008-02-28 15:36:46 as **
  • Evolution strategies –A comprehensive introduction
    Natural Computing: an international journal, Vol. 1, No. 1. (May 2002), pp. 3-52.
    by Hans-Georg Beyer, Hans-Paul Schwefel
    posted to evolutionary-computation evolution-strategies tutorial by gagliol on 2008-02-28 15:30:24 as ** along with 5 people balicea sato-ryu lop kutabar ddahlem
  • The Weighted Majority Algorithm
    Inf. Comput., Vol. 108, No. 2. (1994), pp. 212-261.
    by Nick Littlestone, Manfred K Warmuth
    posted to bandit full-information online regret by gagliol on 2008-02-20 22:48:13 as **
  • Hannan Consistency in On-Line Learning in Case of Unbounded Losses Under Partial Monitoring
    Vol. 4264 (2006), pp. 229-243.
    by Chamy Allenberg, Peter Auer, László Györfi, György Ottucsák
    edited by José L Balcázar, Philip M Long, Frank Stephan, José L Balcázar, Philip M Long, Frank Stephan
    posted to bandit hannan partial-information unbounded-loss by gagliol on 2008-02-20 17:45:12 as **
  • 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 bandit printed by gagliol on 2008-02-07 14:24:01 as ** along with 1 person bsilverthorn
  • Potential-Based Algorithms in On-Line Prediction and Game Theory
    Machine Learning, Vol. 51, No. 3. (2003), pp. 239-261.
    by Nicolò Cesa-Bianchi, Gábor Lugosi
    posted to bandit online-learning printed by gagliol on 2008-01-29 16:27:35 as **
  • Sequential Prediction of Unbounded Stationary Time Series
    Information Theory, IEEE Transactions on, Vol. 53, No. 5. (2007), pp. 1866-1872.
    by L Gyorfi, G Ottucsak
    posted to bandit printed time-series by gagliol on 2008-01-29 16:01:00 as **
  • Improved second-order bounds for prediction with expert advice
    Machine Learning, Vol. 66, No. 2-3. (March 2007), pp. 321-352.
    by Nicolò Cesa-Bianchi, Yishay Mansour, Gilles Stoltz
    posted to bandit online-learning printed unbounded-loss by gagliol on 2008-01-17 14:53:06 as **
  • notes Survival Ananlysis
    by Stephen P Jenkins
    posted to survival-analysis by gagliol on 2008-01-15 16:24:31 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 **
    • ◇温馨提示◇本页的引用地址为： http://www.citeulike.org/user/gagliol/order/to_read

    Result page: 1 2 3 4 5 6 7 8 9 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.