Searching for optimal solutions to a problem using lower bounds obtained from a relaxation is a common idea in Heuristic Search and Planning. In SAT and CSPs, however, explicit rel...
Active learning sequentially selects unlabeled instances to label with the goal of reducing the effort needed to learn a good classifier. Most previous studies in active learning...
Abstract-- This paper focuses on the identification of nonlinear hybrid systems involving unknown nonlinear dynamics. The proposed method extends the framework of [1] by introducin...
In many-to-many communication, a session consists of group of users (we call them members) where each one of the members transmits its traffic to all other members in the group. Th...
We consider a stochastic variant of the NP-hard 0/1 knapsack problem in which item values are deterministic and item sizes are independent random variables with known, arbitrary d...
Brian C. Dean, Michel X. Goemans, Jan Vondrá...