9 search results - page 1 / 2 » Make it practical: a generic linear-time algorithm for solvi... |
ICFP
2000
ACM
13 years 9 months ago
2000
ACM
ÁÒ Ø × Ô Ô Ö Û ÔÖÓÔÓ× Ò Û Ñ Ø Ó ÓÖ Ö Ú Ò ÔÖ Ø ¹ Ð Ð Ò Ö¹Ø Ñ Ð ÓÖ Ø Ñ ÖÓÑ Ø ×Ô ¬ Ø ÓÒ Ó Ñ Ü ÑÙÑ¹Û Ø×ÙÑ ÔÖÓ Ð Ñ Ö...
CSCLP
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. The union-find algorithm can be seen as solving simple equations between variables or constants. With a few lines of code change, we generalise its implementation in CHR...
IJCAI
2007
13 years 6 months ago
2007
In the context of operative disruption management, decision support systems have to evaluate the typically manifold options of responding to disturbances: The temporal shift of ac...
ACSC
2007
IEEE
13 years 11 months ago
2007
IEEE
The standard layered drawing convention for trees in which the vertical placement of a node is given by its level in the tree and each node is centered between its children can le...
KDD
2007
ACM
14 years 5 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...