12950 search results - page 2567 / 2590 » On Optimal Timed Strategies |
MP
2006
13 years 7 months ago
2006
The max-cut and stable set problems are two fundamental NP-hard problems in combinatorial optimization. It has been known for a long time that any instance of the stable set probl...
NETWORK
2006
13 years 7 months ago
2006
With the advancement of video-compression technology and the wide deployment of wireless networks, there is an increasing demand for wireless video communication services, and man...
ORL
2006
13 years 7 months ago
2006
The strategic safety stock placement problem is a constrained separable concave minimization problem and so is solvable, in principle, as a sequence of mixed-integer programming p...
PRL
2006
13 years 7 months ago
2006
This paper considers the problem of designing an active observer to plan a sequence of decisions regarding what target to look at, through a foveal-sensing action. We propose a fr...
SIAMSC
2008
13 years 7 months ago
2008
In this Part II of this paper we first refine the analysis of error-free vector transformations presented in Part I. Based on that we present an algorithm for calculating the round...