1723 search results - page 16 / 345 » Cycling in linear programming problems |
MIC
2003
13 years 11 months ago
2003
E.I.Verriest and F.L.Lewis have presented in [1] a new method to approach the minimum-time control of linear continous-time systems avoiding the Bang-Bang control. Their method re...
JMLR
2006
13 years 9 months ago
2006
The problem of finding the most probable (MAP) configuration in graphical models comes up in a wide range of applications. In a general graphical model this problem is NP hard, bu...
CODES
2005
IEEE
14 years 3 months ago
2005
IEEE
This paper presents an Integer Linear Programming (ILP) approach to the instruction-set extension identification problem. An algorithm that iteratively generates and solves a set...
MP
2002
13 years 9 months ago
2002
In this paper we consider stochastic programming problems where the objective function is given as an expected value of a convex piecewise linear random function. With an optimal s...
ICCAD
1997
IEEE
14 years 2 months ago
1997
IEEE
In this paper, we present an optimal algorithm for solving the simultaneous technology mapping and linear placement problem for tree-structured circuits with the objective of mini...