Abstract. We propose a unifying framework for polyhedral approximation in convex optimization. It subsumes classical methods, such as cutting plane and simplicial decomposition, bu...
Let M be a matroid representable over a (partial) field and B a matrix representable over a sub-partial field . We say that B confines M to if, whenever a -representation matrix ...
We develop an algorithm for opponent modeling in large extensive-form games of imperfect information. It works by observing the opponent’s action frequencies and building an opp...
The Route Shepherd tool demonstrates applications of choosing between routing protocol configurations on the basis of rigorouslysupported theory. Splitting the configuration spa...
Alexander J. T. Gurney, Xianglong Han, Yang Li, Bo...
d Abstract] Prosenjit Bose School of Computer Science Carleton University Ottawa, Canada jit@scs.carleton.ca Paz Carmi Dept. of Computer Science Ben-Gurion Univ. of the Negev Beer-...