Sciweavers

202 search results - page 32 / 41
» Complexity of local search for the p-median problem
Sort
View
ICTAI
2002
IEEE
14 years 1 months ago
Calculus of Variations in Discrete Space for Constrained Nonlinear Dynamic Optimization
In this paper, we propose new dominance relations that can speed up significantly the solution process of nonlinear constrained dynamic optimization problems in discrete time and...
Yixin Chen, Benjamin W. Wah
ICASSP
2011
IEEE
13 years 5 days ago
A combinatorial optimization framework for subset selection in distributed multiple-radar architectures
Abstract—Widely distributed multiple radar architectures offer parameter estimation improvement for target localization. For a large number of radars, the achievable localization...
Hana Godrich, Athina P. Petropulu, H. Vincent Poor
CVPR
2008
IEEE
14 years 10 months ago
Smoothing-based Optimization
We propose an efficient method for complex optimization problems that often arise in computer vision. While our method is general and could be applied to various tasks, it was mai...
Marius Leordeanu, Martial Hebert
AAAI
2008
13 years 10 months ago
A New Incomplete Method for CSP Inconsistency Checking
Checking CSP consistency is shown, in theory, to be an NP-complete problem. There is two families of methods for CSP consistency checking. The first family holds the complete meth...
Belaid Benhamou, Mohamed Réda Saïdi
ATAL
2008
Springer
13 years 10 months ago
Autonomous geocaching: navigation and goal finding in outdoor domains
This paper describes an autonomous robot system designed to solve the challenging task of geocaching. Geocaching involves locating a goal object in an outdoor environment given on...
James Neufeld, Michael Sokolsky, Jason Roberts, Ad...