1277 search results - page 18 / 256 » Terminating Decision Algorithms Optimally |
135
click to vote
KDD
2007
ACM
16 years 3 months ago
2007
ACM
We present DL8, an exact algorithm for finding a decision tree that optimizes a ranking function under size, depth, accuracy and leaf constraints. Because the discovery of optimal...
124
click to vote
GECCO
2004
Springer
15 years 8 months ago
2004
Springer
This paper makes a number of connections between life and various facets of genetic and evolutionary algorithms research. Specifically, it addresses the topics of adaptation, mult...
128
click to vote
ALDT
2009
Springer
15 years 9 months ago
2009
Springer
Aggregating preferences for finding a consensus between several agents is an important issue in many fields, like economics, decision theory and artificial intelligence. In this...
147
click to vote
CPAIOR
2008
Springer
15 years 4 months ago
2008
Springer
The one-step anticipatory algorithm (1s-AA) is an online algorithm making decisions under uncertainty by ignoring future non-anticipativity constraints. It makes near-optimal decis...
136
Voted
RSCTC
2000
Springer
15 years 6 months ago
2000
Springer
The main task in decision tree construction algorithms is to find the "best partition" of the set of objects. In this paper, we investigate the problem of optimal binary ...