7930 search results - page 1305 / 1586 » Greedy in Approximation Algorithms |
168
Voted
IJCAI
1993
15 years 6 months ago
1993
This paper introduces a new concept, a decision tree (or list) over tree patterns, which is a natural extension of a decision tree (or decision list), for dealing with tree struct...
130
Voted
IJCAI
1993
15 years 6 months ago
1993
One of the open problems listed in Rivest and Schapire, 1989] is whether and how that the copies of L in their algorithm can be combined into one for better performance. This pape...
153
click to vote
ALENEX
2009
15 years 6 months ago
2009
A tanglegram is a pair of trees whose leaf sets are in oneto-one correspondence; matching leaves are connected by inter-tree edges. In applications such as phylogenetics or hierar...
135
click to vote
ATAL
2010
Springer
15 years 6 months ago
2010
Springer
Partially Observable Markov Decision Process (POMDP) is a popular framework for planning under uncertainty in partially observable domains. Yet, the POMDP model is riskneutral in ...
142
click to vote
PODS
2010
ACM
15 years 5 months ago
2010
ACM
We study functional and multivalued dependencies over SQL tables with NOT NULL constraints. Under a no-information interpretation of null values we develop tools for reasoning. We...