Search Results for author:
Found 4 papers, 1 papers with code
MurTree: Optimal Classification Trees via Dynamic Programming and Search
Heuristic methods are traditionally used to quickly produce models with reasonably high accuracy.
Partial Queries for Constraint Acquisition
Learning constraint networks is known to require a number of membership queries exponential in the number of variables.
On Backdoors To Tractable Constraint Languages
In the context of CSPs, a strong backdoor is a subset of variables such that every complete assignment yields a residual instance guaranteed to have a specified property.
Soft Constraints of Difference and Equality
Moreover, we show that the maximum number of pairs of equal variables can be approximated by a factor 1/2 with a linear time greedy algorithm.
