Sciweavers

299 search results - page 41 / 60
» Optimizing Polynomial Solvers for Minimal Geometry Problems
Sort
View
DAC
1995
ACM
13 years 11 months ago
Register Allocation and Binding for Low Power
This paper describes a technique for calculating the switching activity of a set of registers shared by di erent data values. Based on the assumption that the joint pdf (probabili...
Jui-Ming Chang, Massoud Pedram
APPROX
2008
Springer
127views Algorithms» more  APPROX 2008»
13 years 9 months ago
Approximating Single Machine Scheduling with Scenarios
In the field of robust optimization, the goal is to provide solutions to combinatorial problems that hedge against variations of the numerical parameters. This constitutes an effor...
Monaldo Mastrolilli, Nikolaus Mutsanas, Ola Svenss...
ICRA
2010
IEEE
121views Robotics» more  ICRA 2010»
13 years 6 months ago
On the global optimum of planar, range-based robot-to-robot relative pose estimation
Abstract— In this paper, we address the problem of determining the relative position and orientation (pose) of two robots navigating in 2D, based on known egomotion and noisy rob...
Nikolas Trawny, Stergios I. Roumeliotis
ORL
2006
105views more  ORL 2006»
13 years 7 months ago
Inventory placement in acyclic supply chain networks
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...
Thomas L. Magnanti, Zuo-Jun Max Shen, Jia Shu, Dav...
TCS
2008
13 years 7 months ago
Minimum-Energy Broadcast and disk cover in grid wireless networks
The Minimum-Energy Broadcast problem is to assign a transmission range to every station of an ad-hoc wireless networks so that (i) a given source station is allowed to perform bro...
Tiziana Calamoneri, Andrea E. F. Clementi, Miriam ...