1914 search results - page 228 / 383 » Evaluation of a Catalytic Search Algorithm |
149
click to vote
ATAL
2010
Springer
15 years 4 months ago
2010
Springer
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...
145
click to vote
KDD
2010
ACM
15 years 2 months ago
2010
ACM
Assume a network (V, E) where a subset of the nodes in V are active. We consider the problem of selecting a set of k active nodes that best explain the observed activation state, ...
138
click to vote
ICDM
2010
IEEE
15 years 2 months ago
2010
IEEE
Traditional Markov network structure learning algorithms perform a search for globally useful features. However, these algorithms are often slow and prone to finding local optima d...
135
click to vote
WWW
2008
ACM
16 years 4 months ago
2008
ACM
Millions of users retrieve information from the Internet using search engines. Mining these user sessions can provide valuable information about the quality of user experience and...
126
click to vote
MICCAI
2009
Springer
16 years 5 months ago
2009
Springer
Estimating the complete set of white matter fascicles (the projectome) from diffusion data requires evaluating an enormous number of potential pathways; consequently, most algorith...