Search results

  • Full text

  • Document type

    • Publication year

  • Organisation

Results: 89
Number of items: 89
  • Open Access
    Inja, M., Kooijman, C., de Waard, M., Roijers, D. M., & Whiteson, S. (2014). Queued Pareto Local Search for Multi-Objective Optimization. In T. Bartz-Beielstein, J. Branke, B. Filipič, & J. Smith (Eds.), Parallel Problem Solving from Nature – PPSN XIII: 13th International Conference, Ljubljana, Slovenia, September 13-17, 2014: proceedings (pp. 589-599). (Lecture Notes in Computer Science; Vol. 8672). Springer. https://doi.org/10.1007/978-3-319-10762-2_58
  • van den Berg, T., & Whiteson, S. (2013). Critical Factors in the Performance of HyperNEAT. In C. Blum (Ed.), GECCO'13: proceedings of the 2013 Genetic and Evolutionary Computation Conference: July 6-10, 2013, Amsterdam, The Netherlands (pp. 759-766). ACM. https://doi.org/10.1145/2463372.2463460
  • Schuth, A., Hofmann, K., Whiteson, S., & de Rijke, M. (2013). Lerot: An Online Learning to Rank Framework. In LivingLab'13: Proceedings of the 2013 workshop on Living labs for information retrieval evaluation (pp. 23-26). ACM. https://doi.org/10.1145/2513150.2513162
  • Hofmann, K., Whiteson, S., & de Rijke, M. (2013). Fidelity, Soundness, and Efficiency of Interleaved Comparison Methods. ACM Transactions on Information Systems, 31(4), Article 17. https://doi.org/10.1145/2536736.2536737
  • van Seijen, H., Whiteson, S., & Kester, L. (2013). Efficient Abstraction Selection in Reinforcement Learning. In A. M. Frisch, & P. Gregory (Eds.), Proceedings, The Tenth Symposium on Abstraction, Reformulation, and Approximation (SARA 2013) (pp. 123-127). AAAI Press. http://www.aaai.org/ocs/index.php/SARA/SARA13/paper/view/7259/6271
  • Open Access
    Roijers, D. M., Whiteson, S., & Oliehoek, F. A. (2013). Multi-Objective Variable Elimination for Collaborative Graphical Games. In AAMAS'13: proceedings of the 2013 International Conference on Autonomous Agents & Multiagent Systems : May 6-10, 2013, St. Paul, MN, USA (Vol. 2, pp. 1209-1210). International Foundation for Autonomous Agents and Multiagent Systems. http://dl.acm.org/citation.cfm?id=2485146
  • Open Access
    Oliehoek, F. A., Whiteson, S., & Spaan, M. T. J. (2013). Approximate Solutions for Factored Dec-POMDPs with Many Agents. BNAIC, 25, 340-341. http://bnaic2013.tudelft.nl/proceedings/papers/paper_31.pdf
  • Open Access
    Roijers, D. M., Whiteson, S., & Oliehoek, F. A. (2013). Computing Convex Coverage Sets for Multi-Objective Coordination Graphs. In P. Perny, M. Pirlot, & A. Tsoukiàs (Eds.), Algorithmic Decision Theory: Third International Conference, ADT 2013, Bruxelles, Belgium, November 12-14, 2013 : proceedings (pp. 309-323). (Lecture Notes in Computer Science; Vol. 8176), (Lecture Notes in Artificial Intelligence). Springer. https://doi.org/10.1007/978-3-642-41575-3_24
  • Open Access
    Oliehoek, F. A., Whiteson, S., & Spaan, M. T. J. (2013). Approximate Solutions for Factored Dec-POMDPs with Many Agents. In AAMAS'13: proceedings of the 2013 International Conference on Autonomous Agents & Multiagent Systems : May 6-10, 2013, St. Paul, MN, USA (Vol. 1, pp. 563-570). International Foundation for Autonomous Agents and Multiagent Systems. http://www.ifaamas.org/Proceedings/aamas2013/docs/p563.pdf
  • Open Access
    Hofmann, K., Whiteson, S., & de Rijke, M. (2013). Balancing Exploration and Exploitation in Listwise and Pairwise Online Learning to Rank for Information Retrieval. Information Retrieval, 16(1), 63-90. https://doi.org/10.1007/s10791-012-9197-9
Page 5 of 9