Sciweavers

374 search results - page 32 / 75
» Lower-bounded facility location
Sort
View
SWAT
2000
Springer
90views Algorithms» more  SWAT 2000»
14 years 1 months ago
Efficient Expected-Case Algorithms for Planar Point Location
Planar point location is among the most fundamental search problems in computational geometry. Although this problem has been heavily studied from the perspective of worst-case que...
Sunil Arya, Siu-Wing Cheng, David M. Mount, Ramesh...
CISS
2008
IEEE
14 years 4 months ago
Cramer Rao bound on target localization estimation in MIMO radar systems
Abstract— This paper presents an analysis of target localization accuracy, attainable by the use of MIMO (MultipleInput Multiple-Output) radar systems, configured with multiple ...
Hana Godrich, Alexander M. Haimovich, Rick S. Blum
COR
2008
96views more  COR 2008»
13 years 10 months ago
Discrete models for competitive location with foresight
We adapt the competitive location model based on maximal covering to include the knowledge that a competitor will enter the market later with a single new facility. The objective ...
Frank Plastria, Lieselot Vanhaverbeke
IPMI
2005
Springer
14 years 3 months ago
Fundamental Limits in 3D Landmark Localization
This work analyses the accuracy of estimating the location of 3D landmarks and characteristic image structures. Based on nonlinear estimation theory we study the minimal stochastic...
Karl Rohr
ISER
1999
Springer
118views Robotics» more  ISER 1999»
14 years 2 months ago
ACME, A Telerobotic Active Measurement Facility
: We are developing a robotic measurement facility which makes it very easy to build “reality-based” models, i.e., computational models of existing, physical objects based on a...
Dinesh K. Pai, Jochen Lang, John E. Lloyd, Robert ...