874 search results - page 76 / 175 » Faster Algorithms for Semi-Matching Problems |
CG
2006
Springer
13 years 11 months ago
2006
Springer
In the last decade, proof-number search and Monte-Carlo methods have successfully been applied to the combinatorial-games domain. Proof-number search is a reliable algorithm. It re...
ICML
2010
IEEE
13 years 8 months ago
2010
IEEE
We study an interesting and challenging problem, online streaming feature selection, in which the size of the feature set is unknown, and not all features are available for learni...
ICML
2010
IEEE
13 years 8 months ago
2010
IEEE
Restricted Boltzmann Machines (RBMs) are a type of probability model over the Boolean cube {-1, 1}n that have recently received much attention. We establish the intractability of ...
JUCS
2008
13 years 7 months ago
2008
: Nowadays Personal Computers (PCs) are often equipped with powerful, multi-core CPU. However, the processing power of the modern PC does not depend only of the processing power of...
DISOPT
2011
13 years 2 months ago
2011
SAT and MAX SAT are among the most prominent problems for which local search algorithms have been successfully applied. A fundamental task for such an algorithm is to increase the...