7930 search results - page 493 / 1586 » Greedy in Approximation Algorithms |
199
click to vote
MST
2007
15 years 6 months ago
2007
In 1996, Khanna and Motwani [KM96] proposed three logic-based optimization problems constrained by planar structure, and offered the hypothesis that these putatively fundamental ...
103
click to vote
CDC
2008
IEEE
16 years 1 months ago
2008
IEEE
— Motivated by some crowd motion models in the presence of noise, we consider an optimal control problem governed by the Fokker-Planck equation. We sketch optimality conditions b...
168
click to vote
AES
2007
Springer
15 years 6 months ago
2007
Springer
We present some heuristics incorporating the philosophy of compatible relaxation into an existing algebraic multigrid method, the so-called multigraph solver of Bank and Smith [1]...
176
click to vote
ICCV
1999
IEEE
16 years 8 months ago
1999
IEEE
Slanted surfaces pose a problem for correspondence algorithms utilizing search because of the greatly increased number of possibilities, when compared with frontoparallel surfaces...
190
click to vote
KDD
2003
ACM
16 years 7 months ago
2003
ACM
In most computer systems, page fault rate is currently minimized by generic page replacement algorithms which try to model the temporal locality inherent in programs. In this pape...