The following pages link to Chuangyin Dang (Q166227):
Displayed 50 items.
- Fuzzy-rough feature selection accelerator (Q277419) (← links)
- A deterministic annealing algorithm for approximating a solution of the min-bisection problem (Q280315) (← links)
- A fixed point iterative approach to integer programming and its distributed computation (Q288180) (← links)
- Robust exponential \(H_\infty\) filtering for discrete-time switched fuzzy systems with time-varying delay (Q307944) (← links)
- \(H_\infty\) control of piecewise-linear systems under unreliable communication links (Q351174) (← links)
- Stability analysis and constrained control of a class of fuzzy positive systems with delays using linear copositive Lyapunov functional (Q351202) (← links)
- Determining the number of clusters using information entropy for mixed data (Q408047) (← links)
- An approach to \(H _{\infty }\) control of a class of nonlinear stochastic systems (Q421176) (← links)
- An objective penalty function of bilevel programming (Q430961) (← links)
- Fast global \(k\)-means clustering based on local geometrical information (Q497555) (← links)
- Nonmonotone second-order Wolfe's line search method for unconstrained optimization problems (Q623198) (← links)
- A FPTAS for computing a symmetric leontief competitive economy equilibrium (Q662291) (← links)
- The \(D_ 2\)-triangulation for simplicial homotopy algorithms for computing solutions of nonlinear equations (Q687034) (← links)
- An interior-point path-following algorithm for computing a Leontief economy equilibrium (Q763393) (← links)
- Consistency measure, inclusion degree and fuzzy measure in decision tables (Q835223) (← links)
- On the smoothing of the square-root exact penalty function for inequality constrained optimization (Q861516) (← links)
- Optimal starting price for eBay-like online auctions (Q863009) (← links)
- A unified approximate reasoning theory suitable for both propositional calcus system\(\mathcal L^\ast\) and predicate calculus system \(\mathcal K^\ast\) (Q866135) (← links)
- A floating-point genetic algorithm for solving the unit commitment problem (Q877631) (← links)
- A deterministic annealing algorithm for approximating a solution of the linearly constrained nonconvex quadratic minimization problem (Q901339) (← links)
- Estimation of long-range dependent parameters based on real traffic (Q956094) (← links)
- Knowledge structure, knowledge granulation and knowledge distance in a knowledge base (Q962844) (← links)
- Positive approximation: an accelerator for attribute reduction in rough set theory (Q991011) (← links)
- Generalizations of fixed point theorems and computation (Q1018311) (← links)
- An arbitrary starting variable dimension algorithm for computing an integer point of a simplex (Q1303784) (← links)
- Triangulations and simplicial methods (Q1346640) (← links)
- A better triangulation for Wright's \(2^n\)-ray algorithm (Q1365094) (← links)
- A note on Nordhaus-Gaddum inequalities for domination. (Q1421486) (← links)
- Upper bounds for the \(k\)-subdomination number of graphs (Q1598803) (← links)
- Simplicial pivoting algorithms for a tractable class of integer programs (Q1598876) (← links)
- An aftertreatment technique for improving the accuracy of Adomian's decomposition method (Q1609143) (← links)
- A smooth path-following algorithm for market equilibrium under a class of piecewise-smooth concave utilities (Q1616935) (← links)
- On the complexity of an expanded Tarski's fixed point problem under the componentwise ordering (Q1637226) (← links)
- Shape constrained risk-neutral density estimation by support vector regression (Q1671251) (← links)
- A Pareto optimal auction mechanism for carbon emission rights (Q1718409) (← links)
- A mixed 0-1 linear programming approach to the computation of all pure-strategy Nash equilibria of a finite \(n\)-person game in normal form (Q1718839) (← links)
- An objective penalty function method for nonlinear programming. (Q1764582) (← links)
- Batch-processing scheduling with setup times (Q1768605) (← links)
- (Q1858419) (redirect page) (← links)
- Inclusion degree: A perspective on measures for rough set data analysis (Q1858420) (← links)
- The solution of the one-dimensional nonlinear Poisson's equations by the decomposition method (Q1879571) (← links)
- A deterministic annealing algorithm for the minimum concave cost network flow problem (Q1952548) (← links)
- Determination of general equilibrium with incomplete markets and default penalties (Q1996177) (← links)
- An objective penalty function method for biconvex programming (Q2052381) (← links)
- A differentiable path-following method to compute subgame perfect equilibria in stationary strategies in robust stochastic games and its applications (Q2076884) (← links)
- Complementarity enhanced Nash's mappings and differentiable homotopy methods to select perfect equilibria (Q2115252) (← links)
- A variant of Harsanyi's tracing procedures to select a perfect equilibrium in normal form games (Q2155890) (← links)
- A differentiable path-following algorithm for computing perfect stationary points (Q2181604) (← links)
- An approximation algorithm for graph partitioning via deterministic annealing neural network (Q2185605) (← links)
- An arbitrary starting tracing procedure for computing subgame perfect equilibria (Q2194134) (← links)