Sciweavers

1802 search results - page 232 / 361
» Model-based Theory Combination
Sort
View
SIAMJO
2011
13 years 4 months ago
A Unifying Polyhedral Approximation Framework for Convex Optimization
Abstract. We propose a unifying framework for polyhedral approximation in convex optimization. It subsumes classical methods, such as cutting plane and simplicial decomposition, bu...
Dimitri P. Bertsekas, Huizhen Yu
JCT
2010
79views more  JCT 2010»
13 years 4 months ago
Confinement of matroid representations to subsets of partial fields
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 ...
Rudi Pendavingh, Stefan H. M. van Zwam
ATAL
2011
Springer
12 years 9 months ago
Game theory-based opponent modeling in large imperfect-information games
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...
Sam Ganzfried, Tuomas Sandholm
SIGCOMM
2012
ACM
11 years 11 months ago
Route shepherd: stability hints for the control plane
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...
PODC
2009
ACM
14 years 10 months ago
Bounding the locality of distributed routing algorithms
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-...
Prosenjit Bose, Paz Carmi, Stephane Durocher