14548 search results - page 45 / 2910 » The Optimal Path-Matching Problem |
ORL
2007
13 years 9 months ago
2007
A method that utilizes the polynomially solvable critical independent set problem for solving the maximum independent set problem on graphs with a nonempty critical independent se...
FSTTCS
2010
Springer
13 years 8 months ago
2010
Springer
This article is a survey of developments in algorithmic convex geometry over the past decade. These include algorithms for sampling, optimization, integration, rounding and learni...
TCS
2011
13 years 4 months ago
2011
The general Bandpass problem is NP-hard and was claimed NP-hard when the number of columns is three. Previously we designed a polynomial time row-stacking algorithm for the three ...
CDC
2009
IEEE
13 years 7 months ago
2009
IEEE
For decentralized control problems with quadratically invariant information constraints, the optimal controller may be found efficiently. In this paper, we show that there are sys...
TON
2012
12 years 11 days ago
2012
—The benefits of using mobile base station to prolong sensor network lifetime have been well recognized. However, due to the complexity of the problem (time-dependent network to...