Sciweavers

507 search results - page 88 / 102
» Sizes of Ordered Decision Trees
Sort
View
SIGGRAPH
1994
ACM
13 years 11 months ago
Drawing and animation using skeletal strokes
strokes makes it particularly attractive in terms of storage size and transmission efficiency. Its efficient implementation is favourable for incorporation into windowing systems a...
Siu Chi Hsu, Irene H. H. Lee
AAAI
2008
13 years 10 months ago
H-DPOP: Using Hard Constraints for Search Space Pruning in DCOP
In distributed constraint optimization problems, dynamic programming methods have been recently proposed (e.g. DPOP). In dynamic programming many valuations are grouped together i...
Akshat Kumar, Adrian Petcu, Boi Faltings
ECAI
2008
Springer
13 years 9 months ago
A BDD Approach to the Feature Subscription Problem
Modern feature-rich telecommunications services offer significant opportunities to human users. To make these services more usable, facilitating personalisation is very important s...
Tarik Hadzic, David Lesaint, Deepak Mehta, Barry O...
AAAI
2004
13 years 9 months ago
SAT-Based Answer Set Programming
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...
Enrico Giunchiglia, Yuliya Lierler, Marco Maratea
IJCAI
1997
13 years 9 months ago
Constraint Satisfaction over Connected Row Convex Constraints
This paper studies constraint satisfaction over connected row-convex (CRC) constraints. It shows that CRC constraints are closed under composition, intersection, and transposition...
Yves Deville, Olivier Barette, Pascal Van Hentenry...