2182 search results - page 208 / 437 » A Robust Algorithm for Solving Nonlinear Programming Problem... |
157
click to vote
FLAIRS
2009
15 years 4 months ago
2009
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...
158
click to vote
GECCO
2007
Springer
16 years 13 days ago
2007
Springer
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...
134
click to vote
JMLR
2006
15 years 6 months ago
2006
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 ...
156
click to vote
LCN
1997
IEEE
15 years 10 months ago
1997
IEEE
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...
182
click to vote
FSTTCS
2009
Springer
16 years 25 days ago
2009
Springer
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...