Sciweavers

14548 search results - page 158 / 2910
» The Optimal Path-Matching Problem
Sort
View
STOC
2012
ACM
217views Algorithms» more  STOC 2012»
12 years 25 days ago
Tight lower bounds for the online labeling problem
We consider the file maintenance problem (also called the online labeling problem) in which n integer items from the set {1, . . . , r} are to be stored in an array of size m ≥...
Jan Bulánek, Michal Koucký, Michael ...
TIT
2002
125views more  TIT 2002»
13 years 10 months ago
Optimal bi-level quantization of i.i.d. sensor observations for binary hypothesis testing
We consider the problem of binary hypothesis testing using binary decisions from independent and identically distributed (i.i.d). sensors. Identical likelihood-ratio quantizers wit...
Qian Zhang, Pramod K. Varshney, Richard D. Wesel
CDC
2010
IEEE
13 years 5 months ago
Vision-based cooperative estimation via multi-agent optimization
Abstract-- In this paper, we investigate a cooperative estimation problem for visual sensor networks based on multiagent optimization techniques. A passivity-based visual motion ob...
Takeshi Hatanaka, Masayuki Fujita, Francesco Bullo
ICRA
2010
IEEE
130views Robotics» more  ICRA 2010»
13 years 9 months ago
On the complexity of optimal reconfiguration planning for modular reconfigurable robots
— This paper presents a thorough analysis of the computational complexity of optimal reconfiguration planning problem for chain-type modular robots, i.e. finding the least number...
Feili Hou, Wei-Min Shen
MCSS
2008
Springer
13 years 8 months ago
Optimal control for unstructured nonlinear differential-algebraic equations of arbitrary index
We study optimal control problems for general unstructured nonlinear differential-algebraic equations of arbitrary index. In particular, we derive necessary conditions in the case ...
Peter Kunkel, Volker Mehrmann