Partially observable stochastic games (POSGs) provide a rich mathematical framework for planning under uncertainty by a group of agents. However, this modeling advantage comes wit...
Generating a random sampling of program trees with specified function and terminal sets is the initial step of many program evolution systems. I present a theoretical and experim...
We present a simple and scalable algorithm for maximum-margin estimation of structured output models, including an important class of Markov networks and combinatorial models. We ...
Benjamin Taskar, Simon Lacoste-Julien, Michael I. ...
This paper studies the optimal configuration of virtual paths in ATM networks. A linear model that minimizes the mrximumjow density of links is proposed for the optimal virtual pa...
We study the branching program complexity of the tree evaluation problem, introduced in [BCM+09a] as a candidate for separating NL from LogCFL. The input to the problem is a roote...
Mark Braverman, Stephen A. Cook, Pierre McKenzie, ...