Sciweavers

1725 search results - page 286 / 345
» Relaxed genetic programming
Sort
View
INFORMS
2000
54views more  INFORMS 2000»
14 years 9 months ago
Time-Indexed Formulations for Machine Scheduling Problems: Column Generation
Time-indexed formulations for machine scheduling problems have received a great deal of attention; not only do the linear programming relaxations provide strong lower bounds, but ...
Marjan van den Akker, Cor A. J. Hurkens, Martin W....
CORR
2010
Springer
162views Education» more  CORR 2010»
14 years 8 months ago
Networked Computing in Wireless Sensor Networks for Structural Health Monitoring
Abstract—This paper studies the problem of distributed computation over a network of wireless sensors. While this problem applies to many emerging applications, to keep our discu...
Apoorva Jindal, Mingyan Liu
ECCV
2010
Springer
14 years 8 months ago
Element-Wise Factorization for N-View Projective Reconstruction
Sturm-Triggs iteration is a standard method for solving the projective factorization problem. Like other iterative algorithms, this method suffers from some common drawbacks such ...
Yuchao Dai, Hongdong Li, Mingyi He
ICRA
2010
IEEE
110views Robotics» more  ICRA 2010»
14 years 8 months ago
On-line calibration of multiple LIDARs on a mobile vehicle platform
— In this paper, we examine the problem of extrinsic calibration of multiple LIDARs on a mobile vehicle platform. To achieve fully automated and on-line calibration, the original...
Chao Gao, John R. Spletzer
NETWORKS
2010
14 years 8 months ago
Complexity of some inverse shortest path lengths problems
The input to an Inverse Shortest Path Lengths Problem (ISPL) consists of a graph G with arc weights, and a collection of source-sink pairs with prescribed distances that do not ne...
Tingting Cui, Dorit S. Hochbaum