7129 search results - page 560 / 1426 » Approximation Algorithms for Treewidth |
216
click to vote
CORR
2008
Springer
15 years 7 months ago
2008
Springer
We propose a convex-concave programming approach for the labeled weighted graph matching problem. The convex-concave programming formulation is obtained by rewriting the weighted ...
225
Voted
DISOPT
2008
15 years 7 months ago
2008
This paper is motivated by the fact that mixed integer nonlinear programming is an important and difficult area for which there is a need for developing new methods and software f...
208
Voted
COMGEO
2007
ACM
15 years 7 months ago
2007
ACM
In this paper we present a package for implementing exact kinetic data structures built on objects which move along polynomial trajectories. We discuss how the package design was ...
156
Voted
SIAMCO
2000
15 years 7 months ago
2000
In this paper, a perturbation expansion technique is introduced to decompose the tracking error of a general adaptive tracking algorithm in a linear regression model. This method ...
206
click to vote
ML
2002
ACM
15 years 7 months ago
2002
ACM
An issue that is critical for the application of Markov decision processes MDPs to realistic problems is how the complexity of planning scales with the size of the MDP. In stochas...