- Proc. Int. Conf. on Arti cial Neural Networks, Vienna, Austria, Aug 2001 Fast score function estimation with application
- Proc. ICRA'01, IEEE Int. Conf. on Robotics & Automation, Seoul, Korea, May 2001. Edge-based features from omnidirectional images for robot
- Neural Computation 14(1):191{215, Jan 2002, published by the MIT Press. Supervised dimension reduction of intrinsically
- Coordinating Principal Component Analyzers J.J. Verbeek and N. Vlassis and B. Krose
- Improving Approximate Value Iteration using Memories and Predictive State Representations
- Greedy Gaussian Mixture Learning for Texture Segmentation
- A probabilistic model for appearance-based robot localization
- Sparse Cooperative Q-learning Jelle R. Kok jellekok@science.uva.nl
- Proc. ACAI'99, Int. Conf. on Machine Learning and Applications, Chania, Greece, July 1999. An informationtheoretic localization criterion for robot map building
- Towards an optimal scoring policy for simulated soccer agents
- A Soft k-Segments Algorithm for Principal J.J. Verbeek and N. Vlassis and B. Krose
- IEEE TRANSACTIONS ON SYSTEMS, MAN, AND CYBERNETICS|PART A: SYSTEMS AND HUMANS, VOL. 29, NO. 4, JULY 1999 393 A Kurtosis-Based Dynamic Approach to Gaussian Mixture Modeling
- Self-Organizing Mixture Models J.J. Verbeek , N. Vlassis, B.J.A. Krose
- Proc. IROS'99, IEEE/RSJ Int. Conf. on Intelligent Robots and Systems, Kyongju, Korea, Oct 1999 Robot Environment Modeling via Principal Component Regression
- Multi-robot decision making using coordination graphs Jelle R. Kok Matthijs T. J. Spaan Nikos Vlassis
- Informatica 32 (2008) 341357 341 The Cross-Entropy Method for Policy Search in Decentralized POMDPs
- Accelerated EM-based clustering of large data sets Jakob J. Verbeek (j.j.verbeek@uva.nl) , Jan R.J. Nunnink
- 9/12/2002. This article will be published in Neural Computation, published by the MIT Press. Efficient Greedy Learning of Gaussian Mixture Models
- A Cross-Entropy Approach to Solving Frans A. Oliehoek1
- The Parallel Nash Memory for Asymmetric Games Frans A. Oliehoek
- Using the Max-Plus Algorithm for Multiagent Decision Making in Coordination Graphs
- Planning with Continuous Actions in Partially Observable Environments
- Gossip-based greedy Gaussian mixture learning Nikos Vlassis1
- A point-based POMDP algorithm for robot planning Matthijs T. J. Spaan Nikos Vlassis
- Proc. Int. Conf. on Systems, Man and Cybernetics, The Hague, The Netherlands, Oct 2004. Anytime algorithms for multiagent decision making
- Auxiliary Particle Filter Robot Localization from High-Dimensional Sensor Observations
- Proc. ICRA'00, IEEE Int. Conf. on Robotics & Automation, San Francisco, CA, Apr 2000, p. 2979{2984 Supervised Linear Feature Extraction for Mobile Robot Localization
- Exploiting Locality of Interaction in Factored Dec-POMDPs Frans A. Oliehoek
- Robot Planning in Partially Observable Continuous Domains
- Proc. ICRA'01, IEEE Int. Conf. on Robotics & Automation, Seoul, Korea, May 2001. Learning task-relevant features from robot data
- IEEE TRANSACTIONS ON NEURAL NETWORKS, VOL. 12, NO. 3, MAY 2001 559 Efficient Source Adaptivity in Independent
- High level coordination of agents based on multiagent Markov decision processes with roles
- A fast point-based algorithm for POMDPs Nikos Vlassis Matthijs T. J. Spaan
- 46 1094-7167/01/$10.00 2001 IEEE IEEE INTELLIGENT SYSTEMS S e m i s e n t i e n t R o b o t s
- COEVOLUTIONARY NASH IN POKER GAMES Frans Oliehoek a
- Multiagent Reinforcement Learning for Urban Traffic Control using Coordination Graphs
- A k-segments algorithm for nding principal curves J.J. Verbeek, N. Vlassis, B. Krose
- Non-communicative multi-robot coordination in dynamic environments
- Multiagent Q-Learning by Context-Specific Coordination Graphs
- Multiagent Planning under Uncertainty with Stochastic Communication Delays Matthijs T.J. Spaan
