Sciweavers

4843 search results - page 207 / 969
» The Shortcut Problem - Complexity and Approximation
Sort
View
116
Voted
JDA
2007
97views more  JDA 2007»
15 years 3 months ago
Local solutions for global problems in wireless networks
In this paper, we review a recently developed class of algorithms that solve global problems in unit distance wireless networks by means of local algorithms. A local algorithm is ...
Jorge Urrutia
166
Voted
ANTSW
2010
Springer
15 years 1 months ago
Theoretical Properties of Two ACO Approaches for the Traveling Salesman Problem
Ant colony optimization (ACO) has been widely used for different combinatorial optimization problems. In this paper, we investigate ACO algorithms with respect to their runtime beh...
Timo Kötzing, Frank Neumann, Heiko Rögli...
172
Voted
CVPR
2011
IEEE
14 years 11 months ago
Is face recognition really a Compressive Sensing problem?
Compressive Sensing has become one of the standard methods of face recognition within the literature. We show, however, that the sparsity assumption which underpins much of this w...
Qinfeng Shi, Anders Eriksson, Anton vandenHengel, ...
CDC
2010
IEEE
126views Control Systems» more  CDC 2010»
14 years 10 months ago
Bifurcation of singular arcs in an optimal control problem for cancer immune system interactions under treatment
A mathematical model for cancer treatment that includes immunological activity is considered as an optimal control problem. In the uncontrolled system there exist both a region of ...
Urszula Ledzewicz, Mohammad Naghnaeian, Heinz Sch&...
139
Voted
CDC
2010
IEEE
151views Control Systems» more  CDC 2010»
14 years 10 months ago
On the optimal solutions of the infinite-horizon linear sensor scheduling problem
This paper studies the infinite-horizon sensor scheduling problem for linear Gaussian processes with linear measurement functions. Several important properties of the optimal infin...
Wei Zhang, Michael P. Vitus, Jianghai Hu, Alessand...