Sciweavers

3250 search results - page 100 / 650
» An Algorithm to Solve a Linear Program
Sort
View
MP
2006
110views more  MP 2006»
14 years 9 months ago
Decomposition and Dynamic Cut Generation in Integer Linear Programming
Decomposition algorithms such as Lagrangian relaxation and Dantzig-Wolfe decomposition are well-known methods that can be used to generate bounds for mixed-integer linear programmi...
Ted K. Ralphs, Matthew V. Galati
EWSN
2004
Springer
15 years 3 months ago
Networked Slepian-Wolf: Theory and Algorithms
Abstract. In this paper, we consider the minimization of a relevant energy consumption related cost function in the context of sensor networks where correlated sources are generate...
Razvan Cristescu, Baltasar Beferull-Lozano, Martin...
GECCO
2003
Springer
128views Optimization» more  GECCO 2003»
15 years 3 months ago
Learning Biped Locomotion from First Principles on a Simulated Humanoid Robot Using Linear Genetic Programming
We describe the first instance of an approach for control programming of humanoid robots, based on evolution as the main adaptation mechanism. In an attempt to overcome some of th...
Krister Wolff, Peter Nordin
WSC
2008
15 years 3 days ago
Discrete Rate Simulation using linear programming
Discrete Rate Simulation (DRS) is a modeling methodology that uses event based logic to simulate linear continuous processes and hybrid systems. These systems are concerned with t...
Cecile Damiron, Anthony Nastasi
IPMI
2009
Springer
15 years 4 months ago
Clustering of the Human Skeletal Muscle Fibers Using Linear Programming and Angular Hilbertian Metrics
In this paper, we present a manifold clustering method for the classification of fibers obtained from diffusion tensor images (DTI) of the human skeletal muscle. Using a linear ...
Radhouène Neji, Ahmed Besbes, Nikos Komodak...