ABSTRACT. The maximum independent set problem (MAXIS) on general graphs is known to be NPhard to approximate within a factor of n1-, for any > 0. However, there are many "...
Venkatesan T. Chakaravarthy, Vinayaka Pandit, Samb...
Many problems in machine learning and statistics can be formulated as (generalized) eigenproblems. In terms of the associated optimization problem, computing linear eigenvectors a...
Traditional web application development often encounters tight coupling problem between access control logic and business logic. It is hard to configure and modify access control ...
Ruixuan Li, Meng Dong, Bin Liu, Jianfeng Lu, Xiaop...
Abstract-- Many tracking problems are split into two subproblems, first a smooth reference trajectory is generated that meet the control design objectives, and then a closed loop c...
Henrik Ohlsson, Fredrik Gustafsson, Lennart Ljung,...
The Markov chain approximation method is an effective and widely used approach for computing optimal values and controls for stochastic systems. It was extended to nonlinear (and p...