258 search results - page 25 / 52 » Weak Bisimulation Approximants |
133
click to vote
ILP
2004
Springer
15 years 5 months ago
2004
Springer
One challenge faced by many Inductive Logic Programming (ILP) systems is poor scalability to problems with large search spaces and many examples. Randomized search methods such as ...
100
click to vote
AMAI
2006
Springer
14 years 12 months ago
2006
Springer
A weakness of classical Markov decision processes (MDPs) is that they scale very poorly due to the flat state-space representation. Factored MDPs address this representational pro...
COR
2006
14 years 11 months ago
2006
Several approximation algorithms with proven performance guarantees have been proposed to find approximate solutions to classical combinatorial optimization problems. However, the...
119
click to vote
ML
2007
ACM
14 years 11 months ago
2007
ACM
We propose a general-purpose stochastic optimization algorithm, the so-called annealing stochastic approximation Monte Carlo (ASAMC) algorithm, for neural network training. ASAMC c...
ICC
2009
IEEE
15 years 6 months ago
2009
IEEE
—A new variation of the Flow-Aware Networking (FAN) concept is presented in the paper. The proposed solution is based on the Approximate Fair Dropping algorithm and called by us ...