Sciweavers

1561 search results - page 251 / 313
» Probability Theory on IF Events
Sort
View
ATAL
2010
Springer
15 years 3 days ago
PAC-MDP learning with knowledge-based admissible models
PAC-MDP algorithms approach the exploration-exploitation problem of reinforcement learning agents in an effective way which guarantees that with high probability, the algorithm pe...
Marek Grzes, Daniel Kudenko
SIGIR
2010
ACM
15 years 3 days ago
SED: supervised experimental design and its application to text classification
In recent years, active learning methods based on experimental design achieve state-of-the-art performance in text classification applications. Although these methods can exploit ...
Yi Zhen, Dit-Yan Yeung
AI
2008
Springer
15 years 1 days ago
Semiring induced valuation algebras: Exact and approximate local computation algorithms
Local computation in join trees or acyclic hypertrees has been shown to be linked to a particular algebraic structure, called valuation algebra. There are many models of this alge...
Jürg Kohlas, Nic Wilson
CGF
2008
137views more  CGF 2008»
15 years 6 hour ago
Exploiting Visibility Correlation in Direct Illumination
The visibility function in direct illumination describes the binary visibility over a light source, e.g., an environment map. Intuitively, the visibility is often strongly correla...
Petrik Clarberg, Tomas Akenine-Möller
CORR
2010
Springer
121views Education» more  CORR 2010»
15 years 2 hour ago
Asynchronous Bounded Expected Delay Networks
We propose a natural generalisation of asynchronous bounded delay (ABD) network models. The commonly used ABD models assume a known bound on message delay. This assumption is ofte...
Rena Bakhshi, Jörg Endrullis, Wan Fokkink, Ju...