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...
We present a faster method of solving optimal planning problems and show that our solution performs up to an order of magnitude faster than Satplan on a variety of problems from t...
Navigating through new voicemail messages to find messages of interest is a time-consuming task, particularly for high-volume users. When checking messages under a time constraint...
We consider the problem of learning classifiers in structured domains, where some objects have a subset of features that are inherently absent due to complex relationships between...
Gal Chechik, Geremy Heitz, Gal Elidan, Pieter Abbe...
Tags or observable features shared by a group of similar agents are effectively used in real and artificial societies to signal intentions and can be used to infer unobservable ...