Sciweavers

3250 search results - page 193 / 650
» An Algorithm to Solve a Linear Program
Sort
View
WSC
2000
15 years 7 months ago
Mathematical programming models of discrete event system dynamics
Analytical models for the dynamics of some discrete event systems are introduced where the system trajectories are solutions to linear and mixed-integer programs. 1 BACKGROUND The...
Lee Schruben
ESA
2009
Springer
112views Algorithms» more  ESA 2009»
16 years 29 days ago
Dynamic Programming on Tree Decompositions Using Generalised Fast Subset Convolution
Abstract. In this paper, we show that algorithms on tree decompositions can be made faster with the use of generalisations of fast subset convolution. Amongst others, this gives al...
Johan M. M. van Rooij, Hans L. Bodlaender, Peter R...
ICASSP
2008
IEEE
16 years 26 days ago
Robust adaptive beamforming using sequential quadratic programming
In this paper, a new algorithm for robust adaptive beamforming is developed. The basic idea of the proposed algorithm is to estimate the difference between the actual and presumed...
Aboulnasr Hassanien, Sergiy A. Vorobyov, Kon Max W...
ICRA
1998
IEEE
147views Robotics» more  ICRA 1998»
15 years 10 months ago
Biologically Inspired Robot Grasping Using Genetic Programming
This paper describes the innovative use of a genetic algorithm to solve the grasp synthesis problem for multifingered robot hands. The goal of our algorithm is to select a `best&#...
Jaime J. Fernandez, Ian D. Walker
CORR
2007
Springer
104views Education» more  CORR 2007»
15 years 6 months ago
Separable convex optimization problems with linear ascending constraints
Separable convex optimization problems with linear ascending inequality and equality constraints are addressed in this paper. An algorithm that explicitly characterizes the optimum...
Arun Padakandla, Rajesh Sundaresan