Sciweavers

3250 search results - page 10 / 650
» An Algorithm to Solve a Linear Program
Sort
View
SAS
2001
Springer
13 years 11 months ago
Solving Regular Tree Grammar Based Constraints
This paper describes the precise speci cation, design, analysis, implementation, and measurements of an e cient algorithm for solving regular tree grammar based constraints. The p...
Yanhong A. Liu, Ning Li, Scott D. Stoller
CODES
2005
IEEE
14 years 29 days ago
An integer linear programming approach for identifying instruction-set extensions
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...
Kubilay Atasu, Günhan Dündar, Can C. &Ou...
FOCS
1990
IEEE
13 years 11 months ago
Parallel Linear Programming in Fixed Dimension Almost Surely in Constant Time
For any xed dimension d, the linear programming problem with n inequality constraints can be solved on a probabilistic CRCW PRAM with O(n) processors almost surely in constant time...
Noga Alon, Nimrod Megiddo
OL
2007
133views more  OL 2007»
13 years 6 months ago
An SQP-type algorithm for nonlinear second-order cone programs
We propose an SQP-type algorithm for solving nonlinear second-order cone programming (NSOCP) problems. At every iteration, the algorithm solves a convex SOCP subproblem in which th...
Hirokazu Kato, Masao Fukushima
DISOPT
2008
82views more  DISOPT 2008»
13 years 7 months ago
Note on pseudolattices, lattices and submodular linear programs
A pseudolattice L is a poset with lattice-type binary operations. Assuming that the pseudolattice permits a modular representation as a family of subsets of a set U with certain c...
Ulrich Faigle, Britta Peis