12264 search results - page 390 / 2453 » An Analysis of the XSL Algorithm |
173
click to vote
PEPM
1994
ACM
15 years 11 months ago
1994
ACM
We present an efficient base algorithm for binding-time analysis based on constraint solving and the union-find algorithm. In practice it has been used to handle all of Standard M...
191
Voted
WCET
2007
15 years 8 months ago
2007
Worst-case execution time (WCET) analysis is indispensable for the successful design and development of systems, which, in addition to their functional constraints, have to satisf...
174
click to vote
KDD
2001
ACM
16 years 7 months ago
2001
ACM
In this paper, we propose a general framework for distributed boosting intended for efficient integrating specialized classifiers learned over very large and distributed homogeneo...
148
click to vote
ATAL
2009
Springer
16 years 1 months ago
2009
Springer
Reinforcement learning algorithms that use eligibility traces, such as Sarsa(λ), have been empirically shown to be effective in learning good estimated-state-based policies in pa...
195
click to vote
CIKM
2009
Springer
16 years 1 months ago
2009
Springer
Traditional boosting algorithms for the ranking problems usually employ the pairwise approach and convert the document rating preference into a binary-value label, like RankBoost....