S'inscrire | Se connecter | FAQ      [?] 
Recent | Unread | Search | Authors | Tags | Export

de gagliol library [557 articles]

Articles dernièrement stockés dans la bibliothèque de gagliol .
  • 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 **
  • Improved Second-Order Bounds for Prediction with Expert Advice
    Vol. 3559 (2005), pp. 217-232.
    by Nicolò Cesa-Bianchi, Yishay Mansour, Gilles Stoltz
    edited by Peter Auer, Ron Meir, Peter Auer, Ron Meir
    posted to bandit partial-information unbounded-loss by gagliol on 2008-02-20 17:42:46 as read
  • How to Beat the Adaptive Multi-Armed Bandit
    CoRR, Vol. abs/cs/0602053 (2006)
    by Varsha Dani, Thomas P Hayes
    posted to bandit printed by gagliol on 2008-02-07 14:27:10 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 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 **
  • 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 **
  • Mathematical tools for hazard function analysis
    Journal of Mathematical Psychology, Vol. 47, No. 5-6. ( 2003), pp. 478-494.
    by Chechile
    posted to survival-analysis by gagliol on 2008-01-14 11:22:41 as **
  • notes An Introduction to Kolmogorov Complexity and Its Applications
    (2007)
    by M Li, P Vitányi
    posted to algorithmic-complexity universal-search by gagliol on 2007-12-20 14:23:13 as **
  • notes An Introduction to Kolmogorov Complexity and Its Applications
    (1997)
    by M Li, P Vitányi
    posted to algorithmic-complexity universal-search by gagliol on 2007-12-20 14:22:09 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 **
  • Bounded optimality
    by Eric J Horvitz
    posted to anytime-algorithms time-quality-trade-off by gagliol on 2007-12-19 16:34:57 as **
  • Reflection and Action Under Scarce Resources: Theoretical Principles and Empirical Study
    (1989), pp. 1121-1127.
    by EJ Horvitz, GF Cooper, DE Heckerman
    posted to anytime-algorithms time-dependent-planning time-quality-trade-off by gagliol on 2007-12-18 17:37:39 as **
  • Reasoning about Beliefs and Actions Under Computational Resource Constraints
    (1990), pp. 301-324.
    by Eric J Horvitz
    edited by M Henrion, RD Shachter, LN Kanal, JF Lemmer
    posted to anytime-algorithms time-dependent-planning time-quality-trade-off by gagliol on 2007-12-18 17:36:01 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 **
  • Heuristic search and evidential reasoning
    (1989), pp. 152-161.
    by O Hansson, A Mayer
    edited by Max Henrion
    posted to toget algorithm-selection by gagliol on 2007-12-18 15:40:00 as **
  • Fine-grained decision-theoretic search control
    (1990), pp. 436-442.
    by Stuart J Russell
    edited by Piero P Bonissone
    posted to toget algorithm-selection by gagliol on 2007-12-18 15:36:17 as **
  • Provably bounded optimal agents
    (~FebruarySeptember--~March 1993), pp. 338-344.
    by SJ Russell, D Subramanian, R Parr
    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 **
  • Anytime Heuristic Search: First Results
    No. UM-CS-1997-050. (, 1997)
    by EA Hansen, S Zilberstein, VA Danilchenko
    posted to anytime-algorithms by gagliol on 2007-12-18 15:19:57 as **
  • 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 **
  • 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 **
  • 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
  • Q-learning
    Machine Learning, Vol. 8, No. 3. (1 May 1992), pp. 279-292.
    by Christopher J Watkins, Peter Dayan
    posted to q-learning mdp markov-decision-process reinforcement-learning by gagliol on 2007-12-17 18:05:56 as * along with 1 person slatre
  • 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 *
  • Dynamic programming
    (1957)
    by Richard E Bellman
    posted to dynamic-programming markov-decision-process reinforcement-learning mdp by gagliol on 2007-12-17 16:00:04 as ** along with 1 person mhinnosaar
  • 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 **
  • 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
    • Remarque: pour citer cette page, utilisez l'url suivante: http://www.citeulike.org/user/gagliol

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