2988 search results - page 180 / 598 » Experiments with a New Boosting Algorithm |
133
click to vote
AAAI
1996
15 years 6 months ago
1996
GSAT is a randomized greedy local repair procedure that was introduced for solving propositional satis ability and constraint satisfaction problems. We present an improvement to G...
142
click to vote
STACS
1999
Springer
15 years 9 months ago
1999
Springer
We present a new technique called balanced randomized tree splitting. It is useful in constructing unknown trees recursively. By applying it we obtain two new results on efficient ...
151
click to vote
CEC
2007
IEEE
15 years 6 months ago
2007
IEEE
— As there are many good optimization algorithms each with its own characteristics, it is very difficult to choose the best method for optimization problems. Thus, it is importa...
145
click to vote
AINA
2007
IEEE
15 years 11 months ago
2007
IEEE
Prospective readers can quickly determine whether a document is relevant to their information need if the significant phrases (or keyphrases) in this document are provided. Althou...
238
click to vote
ICDE
2002
IEEE
16 years 6 months ago
2002
IEEE
We present a diff algorithm for XML data. This work is motivated by the support for change control in the context of the Xyleme project that is investigating dynamic warehouses ca...