7006 search results - page 460 / 1402 » Approximation Algorithms |
122
click to vote
AUTOMATICA
2004
15 years 5 months ago
2004
In this paper, the problem of non-regular static state feedback linearization of a ne nonlinear systems is considered. First of all, a new canonical form for non-regular feedback ...
157
click to vote
CORR
2010
Springer
15 years 5 months ago
2010
Springer
Adaptive sparse coding methods learn a possibly overcomplete set of basis functions, such that natural image patches can be reconstructed by linearly combining a small subset of t...
150
click to vote
INFOCOM
1999
IEEE
15 years 9 months ago
1999
IEEE
Abstract--CEDAR is an algorithm for QoS routing in ad hoc network environments. It has three key components: (a) the establishment and maintenance of a self-organizing routing infr...
121
click to vote
EVOW
2006
Springer
15 years 8 months ago
2006
Springer
This paper proposes an evolutionary algorithm (EA) that is applied to the traveling salesman problem (TSP). Existing approximation methods to address the TSP known to be state-of-t...
149
click to vote
RSS
2007
15 years 6 months ago
2007
— We present an efficient algorithm to compute the generalized penetration depth (PDg) between rigid models. Given two overlapping objects, our algorithm attempts to compute the...