Sciweavers

603 search results - page 23 / 121
» A General Approximation Technique for Constrained Forest Pro...
Sort
View
FOCS
2005
IEEE
15 years 7 months ago
How to Pay, Come What May: Approximation Algorithms for Demand-Robust Covering Problems
Robust optimization has traditionally focused on uncertainty in data and costs in optimization problems to formulate models whose solutions will be optimal in the worstcase among ...
Kedar Dhamdhere, Vineet Goyal, R. Ravi, Mohit Sing...
ICRA
1998
IEEE
118views Robotics» more  ICRA 1998»
15 years 5 months ago
A General Theory for Positioning and Orienting 2D Polygonal or Curved Parts using Intelligent Motion Surfaces
: In this paper we present novel algorithms to compute quasi-static and dynamic equilibrium positions and orientations (if any) of 2D polygonal or curved parts placed on general sh...
Murilo G. Coutinho, Peter M. Will
CDC
2008
IEEE
15 years 8 months ago
Simultaneous placement and assignment for exploration in mobile backbone networks
Abstract— This paper presents new algorithms for conducting cooperative sensing using a mobile backbone network. This hierarchical sensing approach combines backbone nodes, which...
Emily M. Craparo, Jonathan P. How, Eytan Modiano
EMO
2003
Springer
109views Optimization» more  EMO 2003»
15 years 6 months ago
A Population and Interval Constraint Propagation Algorithm
We present PICPA, a new algorithm for tackling constrained continuous multi-objective problems. The algorithm combines constraint propagation techniques and evolutionary concepts. ...
Vincent Barichard, Jin-Kao Hao
TIT
2008
83views more  TIT 2008»
15 years 1 months ago
Constrained Codes as Networks of Relations
We address the well-known problem of determining the capacity of constrained coding systems. While the onedimensional case is well understood to the extent that there are technique...
Moshe Schwartz, Jehoshua Bruck