583 search results - page 8 / 117 » Efficient algorithms for constructing decision trees with co... |
CP
2007
Springer
15 years 3 months ago
2007
Springer
We present an algorithm for compressing table constraints representing allowed or disallowed tuples. This type of constraint is used for example in configuration problems, where t...
IJCAI
2001
14 years 11 months ago
2001
The automatic generation of diagnostic decision trees from qualitative models is a reasonable compromise between the advantages of using a modelbased approach in technical domains...
EUROPAR
2007
Springer
15 years 3 months ago
2007
Springer
Selecting the close-to-optimal collective algorithm based on the parameters of the collective call at run time is an important step for achieving good performance of MPI applicatio...
ROBOCUP
2000
Springer
15 years 1 months ago
2000
Springer
Self localization seems necessary for mobile robot navigation. The conventional method such as geometric reconstruction from landmark observations is generally time-consuming and ...
69
Voted
COLT
2003
Springer
15 years 2 months ago
2003
Springer
We consider three natural models of random logarithmic depth decision trees over Boolean variables. We give an efficient algorithm that for each of these models learns all but an ...