Authentication email has already been sent, please check your email box: and activate it as soon as possible.
You can login to My Profile and manage your email alerts.
If you haven’t received the email, please:
|
|
There are 14 papers published in subject: > since this site started. |
Results per page: | 14 Total, 2 Pages | << First < Previous 1 2 |
Select Subject |
Select/Unselect all | For Selected Papers |
Saved Papers
Please enter a name for this paper to be shown in your personalized Saved Papers list
|
1. Robust stability of Markovian jumping genetic regulatory netwroks with mode-dependent delays | |||
Zhang Wenbing,Fang Jianan ,Tang Yang | |||
Information Science and System Science 01 October 2010 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:In this paper, the robust stability analysis problem is investigated for a class of Markovian jumping genetic regulatory networks with parameter uncertainties and mode-dependent delays, which varies randomly according to the Markov state and exist in both translation and feedback regulation processes. The purpose of the addressed stability analysis problem is to establish some easily verifiable conditions under which the Markovian jumping genetic regulatory networks with parameter uncertainties and mode-dependent delays is asymptotically stable. By utilizing a new Lyapunov functional and a lemma, we derive delay-dependent sufficient conditions ensuring the robust stability of the gene regulatory networks in the form of linear inequalities. Illustrative examples are exploited to show the effectiveness of the derived LMIs(linear matrix inequalities)-based stability conditions. | |||
TO cite this article:Zhang Wenbing,Fang Jianan ,Tang Yang . Robust stability of Markovian jumping genetic regulatory netwroks with mode-dependent delays[OL].[ 1 October 2010] http://en.paper.edu.cn/en_releasepaper/content/4387185 |
2. Discrete Particle Swarm Optimization for Terminal Assignment Problems | |||
WANG Jiahai,CAI Yiqiao | |||
Information Science and System Science 19 August 2010 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:This paper presents a novel discrete particle swarm optimization (PSO) based on estimation of distribution (EDA), named DPSO-EDA, for terminal assignment problem (TEAP). EDAs sample new solutions from a probability model which characterizes the distribution of promising solutions in the search space at each generation. The DPSO-EDA incorporates the global statistical information collected from personal best solutions of all particles into the PSO, and therefore each particle has comprehensive learning and search ability. Simulation results on several problem instances show that the DPSO-EDA is better than previous methods. | |||
TO cite this article:WANG Jiahai,CAI Yiqiao. Discrete Particle Swarm Optimization for Terminal Assignment Problems[OL].[19 August 2010] http://en.paper.edu.cn/en_releasepaper/content/4382268 |
3. A fictitious play approach for minimizing the total weighted tardiness in a job shop | |||
Gu Hanyu ,Tao Jiping ,Xi Yugeng | |||
Information Science and System Science 30 April 2010 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:A noncooperative game model is established for the job shop scheduling problem of minimizing total weighted tardiness. Fictitious play is used to compute the Nash-equilibrium (NE). Then by exploiting the equivalence of the NE of the proposed game model and the optimal solutions of the Lagrangian dual problem and its linear programming dual problem, $\\alpha$-point idea is applied to construct feasible schedules. Furthermore a simple local search method is designed to further improve the schedule performance. Numerical results on classical benchmark instances demonstrate the effectiveness of the proposed algorithm. | |||
TO cite this article:Gu Hanyu ,Tao Jiping ,Xi Yugeng . A fictitious play approach for minimizing the total weighted tardiness in a job shop[OL].[30 April 2010] http://en.paper.edu.cn/en_releasepaper/content/42513 |
4. Congruence Relations on Lattice Implication Algebras | |||
Liu Yi,Xu Yang | |||
Information Science and System Science 31 December 2009 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:Lattice implication algebra is an important logic algebra, congruence relations is one of important contents in it. The basic properties and the structures of general congruence relations on lattice implication algebras are discussed; The results that a lattice implication algebra is congruence-permutable is obtained; At last, properties of congruence relations on finite lattice implication algebras are discussed. | |||
TO cite this article:Liu Yi,Xu Yang. Congruence Relations on Lattice Implication Algebras[OL].[31 December 2009] http://en.paper.edu.cn/en_releasepaper/content/38355 |
Select/Unselect all | For Selected Papers |
Saved Papers
Please enter a name for this paper to be shown in your personalized Saved Papers list
|
|
Results per page: | 14 Total, 2 Pages | << First < Previous 1 2 |
About Sciencepaper Online | Privacy Policy | Terms & Conditions | Contact Us
© 2003-2012 Sciencepaper Online. unless otherwise stated