1277 search results - page 36 / 256 » Terminating Decision Algorithms Optimally |
106
click to vote
AAAI
2006
15 years 4 months ago
2006
The majority of the existing algorithms for learning decision trees are greedy--a tree is induced top-down, making locally optimal decisions at each node. In most cases, however, ...
138
click to vote
CORR
2007
Springer
15 years 3 months ago
2007
Springer
The Steiner tree problem is a classical NP-hard optimization problem with a wide range of practical applications. In an instance of this problem, we are given an undirected graph ...
EVOW
2004
Springer
15 years 8 months ago
2004
Springer
Recently, an approach has been presented to minimize Disjoint Sumof-Products (DSOPs) based on Binary Decision Diagrams (BDDs). Due to the symbolic representation of cubes for larg...
113
click to vote
SAC
2006
ACM
15 years 9 months ago
2006
ACM
We propose a method for induction of compact optimal recommendation policies based on discovery of frequent itemsets in a purchase database, followed by the application of standar...
133
Voted
AAMAS
2011
Springer
14 years 10 months ago
2011
Springer
We consider a problem domain where coalitions of agents are formed in order to execute tasks. Each task is assigned at most one coalition of agents, and the coalition can be reorg...