Sciweavers

557 search results - page 86 / 112
» On the set multi-cover problem in geometric settings
Sort
View
TIT
2008
86views more  TIT 2008»
13 years 8 months ago
Optimal Prefix Codes for Infinite Alphabets With Nonlinear Costs
Let P = {p(i)} be a measure of strictly positive probabilities on the set of nonnegative integers. Although the countable number of inputs prevents usage of the Huffman algorithm, ...
Michael B. Baer
SIAMCO
2002
77views more  SIAMCO 2002»
13 years 8 months ago
Robust Optimal Switching Control for Nonlinear Systems
Abstract. We formulate a robust optimal control problem for a general nonlinear system with finitely many admissible control settings and with costs assigned to switching of contro...
Joseph A. Ball, Jerawan Chudoung, Martin V. Day
TSMC
1998
82views more  TSMC 1998»
13 years 8 months ago
To push or not to push: on the rearrangement of movable objects by a mobile robot
—We formulate and address the problem of planning a pushing manipulation by a mobile robot which tries to rearrange several movable objects in its work space. We present an algor...
Ohad Ben-Shahar, Ehud Rivlin
ICRA
2010
IEEE
129views Robotics» more  ICRA 2010»
13 years 7 months ago
Improving mutual information-based visual servoing
— In a previous paper [3], we proposed a new way to achieve visual servoing. Rather than minimizing the error between the position of two set of geometric features, we proposed t...
Amaury Dame, Éric Marchand
SIAMSC
2010
114views more  SIAMSC 2010»
13 years 7 months ago
Smoothed Aggregation Multigrid for Markov Chains
Abstract. A smoothed aggregation multigrid method is presented for the numerical calculation of the stationary probability vector of an irreducible sparse Markov chain. It is shown...
Hans De Sterck, Thomas A. Manteuffel, Stephen F. M...