Sciweavers

497 search results - page 39 / 100
» Approximating max-min linear programs with local algorithms
Sort
View
DCOSS
2006
Springer
15 years 1 months ago
Optimal Placement and Selection of Camera Network Nodes for Target Localization
The paper studies the optimal placement of multiple cameras and the selection of the best subset of cameras for single target localization in the framework of sensor networks. The ...
Ali Ozer Ercan, Danny B. Yang, Abbas El Gamal, Leo...
CCCG
2010
14 years 11 months ago
Approximating the independent domatic partition problem in random geometric graphs - an experimental study
We investigate experimentally the Domatic Partition (DP) problem, the Independent Domatic Partition (IDP) problem and the Idomatic partition problem in Random Geometric Graphs (RG...
Dhia Mahjoub, Angelika Leskovskaya, David W. Matul...
FLAIRS
2004
14 years 11 months ago
Backcalculation of Airport Flexible Pavement Non-Linear Moduli Using Artificial Neural Networks
The Heavy Weight Deflectometer (HWD) test is one of the most widely used tests for assessing the structural integrity of airport pavements in a non-destructive manner. The elastic...
Kasthurirangan Gopalakrishnan, Marshall R. Thompso...
CONSTRAINTS
2008
138views more  CONSTRAINTS 2008»
14 years 10 months ago
Minimization of Locally Defined Submodular Functions by Optimal Soft Arc Consistency
Submodular function minimization is a polynomially-solvable combinatorial problem. Unfortunately the best known general-purpose algorithms have high-order polynomial time complexi...
Martin C. Cooper
SIAMSC
2008
147views more  SIAMSC 2008»
14 years 9 months ago
Global and Finite Termination of a Two-Phase Augmented Lagrangian Filter Method for General Quadratic Programs
We present a two-phase algorithm for solving large-scale quadratic programs (QPs). In the first phase, gradient-projection iterations approximately minimize an augmented Lagrangian...
Michael P. Friedlander, Sven Leyffer