4843 search results - page 415 / 969 » The Shortcut Problem - Complexity and Approximation |
108
click to vote
WSC
2004
15 years 6 months ago
2004
In many practical applications of simulation it is desirable to optimize the levels of integer or binary variables that are inputs for the simulation model. In these cases, the ob...
106
click to vote
NIPS
2003
15 years 6 months ago
2003
This paper addresses the problem of untangling hidden graphs from a set of noisy detections of undirected edges. We present a model of the generation of the observed graph that in...
131
click to vote
ARC
2008
Springer
15 years 5 months ago
2008
Springer
: This paper describes the theory of feedback control in the class inputs which allow delta-functions and their derivatives. It indicates a modification of dynamic programming tech...
126
click to vote
JGO
2008
15 years 4 months ago
2008
We show that a compact feasible set of a standard semi-infinite optimization problem can be approximated arbitrarily well by a level set of a single smooth function with certain r...
139
Voted
SIAMCOMP
2008
15 years 4 months ago
2008
We consider a game-theoretical variant of the Steiner forest problem in which each player j, out of a set of k players, strives to connect his terminal pair (sj, tj) of vertices in...