10608 search results - page 526 / 2122 » Complexity of O'Hara's Algorithm |
192
click to vote
COLT
2000
Springer
15 years 10 months ago
2000
Springer
We describe a novel family of PAC model algorithms for learning linear threshold functions. The new algorithms work by boosting a simple weak learner and exhibit complexity bounds...
127
click to vote
ICTAI
2005
IEEE
15 years 12 months ago
2005
IEEE
In this paper, a combinatorial auction problem is modeled as a NP-complete set packing problem and a Lagrangian relaxation based heuristic algorithm is proposed. Extensive experim...
153
click to vote
WG
2005
Springer
15 years 11 months ago
2005
Springer
In this paper, we consider the recognition problem on the HHDS-free graphs, a class of homogeneously orderable graphs, and we show that it has polynomial time complexity. In partic...
159
click to vote
ICA
2004
Springer
15 years 11 months ago
2004
Springer
Presented here is a generalization of the modified relative Newton method, recently proposed in [1] for quasi-maximum likelihood blind source separation. Special structure of the ...
163
click to vote
ACG
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. Monte-Carlo tree search, especially the UCT algorithm and its enhancements, have become extremely popular. Because of the importance of this family of algorithms, a deepe...