This is a preview. Log in through your library . Abstract A logarithmic-exponential dual formulation is proposed in this paper for bounded integer programming problems. This new dual formulation ...
Model abstraction for finite state automata is helpful for decreasing computational complexity and improving comprehensibility for the verification and control synthesis of discrete-event systems (DES ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback