507 search results - page 88 / 102 » Sizes of Ordered Decision Trees |
SIGGRAPH
1994
ACM
15 years 4 months ago
1994
ACM
strokes makes it particularly attractive in terms of storage size and transmission efficiency. Its efficient implementation is favourable for incorporation into windowing systems a...
100
Voted
AAAI
2008
15 years 2 months ago
2008
In distributed constraint optimization problems, dynamic programming methods have been recently proposed (e.g. DPOP). In dynamic programming many valuations are grouped together i...
108
click to vote
ECAI
2008
Springer
15 years 2 months ago
2008
Springer
Modern feature-rich telecommunications services offer significant opportunities to human users. To make these services more usable, facilitating personalisation is very important s...
97
Voted
AAAI
2004
15 years 1 months ago
2004
The relation between answer set programming (ASP) and propositional satisfiability (SAT) is at the center of many research papers, partly because of the tremendous performance boo...
IJCAI
1997
15 years 1 months ago
1997
This paper studies constraint satisfaction over connected row-convex (CRC) constraints. It shows that CRC constraints are closed under composition, intersection, and transposition...