Sciweavers

3250 search results - page 135 / 650
» An Algorithm to Solve a Linear Program
Sort
View
160
Voted
ICCV
2003
IEEE
16 years 7 months ago
Scene Modeling Based on Constraint System Decomposition Techniques
We present a new approach to 3D scene modeling based on geometric constraints. Contrary to the existing methods, we can quickly obtain 3D scene models that respect the given const...
Marta Wilczkowiak, Gilles Trombettoni, Christophe ...
154
Voted
GLOBECOM
2007
IEEE
15 years 11 months ago
Distributed Maximum Lifetime Routing in Wireless Sensor Networks Based on Regularization
— The maximum lifetime routing problem in wireless sensor networks has received increasing attention in recent years. One way is to formulate it as a linear programming problem b...
Vahid Shah-Mansouri, Vincent W. S. Wong
COR
2010
177views more  COR 2010»
15 years 5 months ago
Hybridization of very large neighborhood search for ready-mixed concrete delivery problems
Companies in the concrete industry are facing the following scheduling problem on a daily basis: concrete produced at several plants has to be delivered at customers' constru...
Verena Schmid, Karl F. Doerner, Richard F. Hartl, ...
ATAL
2009
Springer
15 years 11 months ago
Point-based incremental pruning heuristic for solving finite-horizon DEC-POMDPs
Recent scaling up of decentralized partially observable Markov decision process (DEC-POMDP) solvers towards realistic applications is mainly due to approximate methods. Of this fa...
Jilles Steeve Dibangoye, Abdel-Illah Mouaddib, Bra...
CDC
2010
IEEE
15 years 3 days ago
A "joint+marginal" algorithm for polynomial optimization
Abstract-- We present a new algorithm for solving a polynomial program P based on the recent "joint + marginal" approach of the first author for parametric polynomial opt...
Jean B. Lasserre, Tung Phan Thanh