3082 search results - page 172 / 617 » New Bounds for the Controller Problem |
164
click to vote
CDC
2009
IEEE
15 years 9 months ago
2009
IEEE
Abstract— Many problems associated with networked systems can be formulated as network utility maximization (NUM) problems. NUM problems maximize a global separable measure of ne...
154
click to vote
COMGEO
2010
ACM
15 years 4 months ago
2010
ACM
r Numerical Abstractions6 Roberto Bagnaraa , Patricia M. Hillb , Enea Zaffanellaa aDepartment of Mathematics, University of Parma, Italy bSchool of Computing, University of Leeds, ...
138
click to vote
FOCS
2002
IEEE
15 years 9 months ago
2002
IEEE
We obtain a near-tight bound of O(n3+ε ), for any ε > 0, on the complexity of the overlay of the minimization diagrams of two collections of surfaces in four dimensions. This...
164
Voted
CDC
2010
IEEE
14 years 11 months ago
2010
IEEE
Abstract-- In this paper we consider the problem of monitoring a known set of stationary features (or locations of interest) in an environment. To observe a feature, a robot must v...
126
Voted
CORR
2010
Springer
15 years 4 months ago
2010
Springer
This paper studies the optimization of observation channels (stochastic kernels) in partially observed stochastic control problems. In particular, existence, continuity, and convex...