Sciweavers

960 search results - page 126 / 192
» Optimal Monte Carlo Algorithms
Sort
View
JMLR
2008
159views more  JMLR 2008»
15 years 4 months ago
Near-Optimal Sensor Placements in Gaussian Processes: Theory, Efficient Algorithms and Empirical Studies
When monitoring spatial phenomena, which can often be modeled as Gaussian processes (GPs), choosing sensor locations is a fundamental task. There are several common strategies to ...
Andreas Krause, Ajit Paul Singh, Carlos Guestrin
ICDM
2002
IEEE
448views Data Mining» more  ICDM 2002»
15 years 9 months ago
Feature Selection Algorithms: A Survey and Experimental Evaluation
In view of the substantial number of existing feature selection algorithms, the need arises to count on criteria that enables to adequately decide which algorithm to use in certai...
Luis Carlos Molina, Lluís Belanche, À...
AAAI
2007
15 years 6 months ago
Unscented Message Passing for Arbitrary Continuous Variables in Bayesian Networks
Since Bayesian network (BN) was introduced in the field of artificial intelligence in 1980s, a number of inference algorithms have been developed for probabilistic reasoning. Ho...
Wei Sun, Kuo-Chu Chang
ML
2006
ACM
113views Machine Learning» more  ML 2006»
15 years 4 months ago
Learning to bid in bridge
Bridge bidding is considered to be one of the most difficult problems for game-playing programs. It involves four agents rather than two, including a cooperative agent. In additio...
Asaf Amit, Shaul Markovitch
CORR
2002
Springer
113views Education» more  CORR 2002»
15 years 4 months ago
Robust Global Localization Using Clustered Particle Filtering
Global mobile robot localization is the problem of determining a robot's pose in an environment, using sensor data, when the starting position is unknown. A family of probabi...
Javier Nicolás Sánchez, Adam Milstei...