Sciweavers

210 search results - page 10 / 42
» Fast Global Optimization of Curvature
Sort
View
ICRA
2000
IEEE
111views Robotics» more  ICRA 2000»
15 years 1 months ago
Learning Globally Consistent Maps by Relaxation
Mobile robots require the ability to build their own maps to operate in unknown environments. A fundamental problem is that odometry-based dead reckoning cannot be used to assign ...
Tom Duckett, Stephen Marsland, Jonathan Shapiro
96
Voted
ICCAD
1997
IEEE
101views Hardware» more  ICCAD 1997»
15 years 1 months ago
NRG: global and detailed placement
We present a new approach to the placement problem. The proposed approach consists of analyzing the input circuit and deciding on a two-dimensional global grid for that particular...
Majid Sarrafzadeh, Maogang Wang
EVOW
2009
Springer
15 years 4 months ago
Discrete Particle Swarm Optimization for Multiple Destination Routing Problems
This paper proposes a discrete particle swarm optimization (DPSO) to solve the multiple destination routing (MDR) problems. The problem has been proven to be NP-complete and the tr...
Zhi-hui Zhan, Jun Zhang
CDC
2008
IEEE
161views Control Systems» more  CDC 2008»
14 years 11 months ago
A fast algorithm to compute the controllability, decentralized fixed-mode, and minimum-phase radius of LTI systems
In this paper, an efficient algorithm is presented for solving the 2-D optimization problem which is associated with computing the robustness measures of a number of linear time-in...
Simon Lam, Edward J. Davison
CORR
2011
Springer
220views Education» more  CORR 2011»
14 years 4 months ago
On a linear programming approach to the discrete Willmore boundary value problem and generalizations
We consider the problem of finding (possibly non connected) discrete surfaces spanning a finite set of discrete boundary curves in the three-dimensional space and minimizing (glo...
Thomas Schoenemann, Simon Masnou, Daniel Cremers