Lexicographical order, inequality systems and optimization

2005 ◽  
pp. 203-212 ◽  
Author(s):  
J. E. Martínez-Legaz
Keyword(s):  
Lexicographical Order ◽  
Inequality Systems

DESIGNING A SYSTOLIC ALGORITHM FOR GENERATING WELL-FORMED PARENTHESIS STRINGS

2004 ◽  
Vol 14 (01) ◽  
pp. 83-97
Author(s):  
JONG-CHUANG TSAY
Keyword(s):  
Linear Array ◽  
Vlsi Implementation ◽  
Processor Array ◽  
Lexicographical Order ◽  
Systolic Algorithm ◽  
Left And Right ◽  
Local Connection

A parenthesis string is a string of left and right parentheses. The string is well-formed when it consists of balanced pairs of left and right parentheses. This study presents a novel systolic algorithm for generating all the well-formed parenthesis strings in lexicographical order. The algorithm is cost-optimal and is run on a linear array of processors such that each well-formed parenthesis string can be generated in three time steps. The processor array is appropriate for VLSI implementation, since it has the features of modularity, regularity, and local connection.

scholarly journals Locally polyhedral linear inequality systems

1998 ◽  
Vol 270 (1-3) ◽  
pp. 231-253 ◽  
Author(s):  
Edward J. Anderson ◽  
Miguel A. Goberna ◽  
Marco A. López
Keyword(s):  
Linear Inequality ◽  
Linear Inequality Systems ◽  
Inequality Systems

Inequality Systems

1970 ◽  
pp. 7-30
Author(s):  
Josef Stoer ◽  
Christoph Witzgall
Keyword(s):  
Inequality Systems

Nonlinear error bounds for quasiconvex inequality systems

2015 ◽  
Vol 11 (1) ◽  
pp. 107-120 ◽  
Author(s):  
Satoshi Suzuki ◽  
Daishi Kuroiwa
Keyword(s):  
Error Bounds ◽  
Nonlinear Error ◽  
Inequality Systems ◽  
Nonlinear Error Bounds
Sign in / Sign up

Export Citation Format

Share Document