6315 search results - page 231 / 1263 » Approximating Solution Structure |
227
click to vote
WINE
2010
Springer
15 years 4 months ago
2010
Springer
We consider the Stackelberg shortest-path pricing problem, which is defined as follows. Given a graph G with fixed-cost and pricable edges and two distinct vertices s and t, we may...
201
click to vote
ECAI
2010
Springer
15 years 4 months ago
2010
Springer
The proposed feature selection method aims to find a minimum subset of the most informative variables for classification/regression by efficiently approximating the Markov Blanket ...
177
click to vote
SIAMSC
2010
15 years 1 months ago
2010
In this paper we proposed quasi-Newton and limited memory quasi-Newton methods for objective functions defined on Grassmannians or a product of Grassmannians. Specifically we defin...
245
click to vote
INFOCOM
2012
IEEE
13 years 9 months ago
2012
IEEE
—In many applications, it is a basic operation for the sink to periodically collect reports from all sensors. Since the data gathering process usually proceeds for many rounds, i...
175
click to vote
TAPIA
2005
ACM
16 years 4 days ago
2005
ACM
We present a numerical study for two systems of conservation laws using a spacetime discontinuous Galerkin (SDG) method with causal spacetime triangulations and the piecewise cons...