1277 search results - page 186 / 256 » Terminating Decision Algorithms Optimally |
145
Voted
ML
2008
ACM
15 years 3 months ago
2008
ACM
Significant changes in the instance distribution or associated cost function of a learning problem require one to reoptimize a previously-learned classifier to work under new cond...
134
Voted
ICS
2010
Tsinghua U.
16 years 1 months ago
2010
Tsinghua U.
We consider the problem of boosting the accuracy of weak learning algorithms in the agnostic learning framework of Haussler (1992) and Kearns et al. (1992). Known algorithms for t...
116
Voted
SIROCCO
2008
15 years 5 months ago
2008
Abstract. We consider a fixed, undirected, known network and a number of "mobile agents" which can traverse the network in synchronized steps. Some nodes in the network m...
134
Voted
GECCO
2007
Springer
15 years 9 months ago
2007
Springer
The Second Harmonic Generation (SHG), a process that turns out to be a good test case in the physics lab, can also be considered as a fairly simple theoretical test function for g...
141
Voted
PLDI
2003
ACM
15 years 9 months ago
2003
ACM
This paper reports on a new approach to solving a subset-based points-to analysis for Java using Binary Decision Diagrams (BDDs). In the model checking community, BDDs have been s...