نتایج جستجو برای: united stable solution set

تعداد نتایج: 1510722  

Journal: :international journal of industrial mathematics 2013
h. vu n. van hoa v. i. slyn'ko

Journal: :Reliable Computing 1995
Ludmila Kupriyanova

We will denote intervals and interval vectors by Latin letters a, b, e . . . . (with or without index), interval matrices by capital Latin letters A, B, C , . . . Real vectors and matrices will be denoted by Latin letters with lower dots q, .b,e.,..., A., B., C . , . . . Endpoints of intervals and of interval vectors will be denoted by a_, ~ (lower and upper endpoims, respectively), real n u m ...

2012
Elena Mielcová

The main aim of this article is to compare the results of classical Shapley value concept with results of the Shapley value extended to the cooperative games with fuzzy coalitions applied on the real data of the cooperative simple game – in this case the data from the voting in the Lower House of the Czech Parliament 20022012. One of the most intriguing tasks is to describe real system problems...

Journal: :Journal of Pure and Applied Algebra 1995

We present a numerical study of a one-dimensional version of the Burridge-Knopoff model [16] of N-site chain of spring-blocks with stick-slip dynamics. Our numerical analysis and computer simulations lead to a set of different results corresponding to different boundary conditions. It is shown that we can convert a chaotic behaviour system to a highly ordered and periodic behaviour by making on...

2016
Jiachao Wu Hengfei Li Nir Oren Timothy J. Norman

In this paper we combine fuzzy set theory and argumentation to facilitate the use of fuzzy arguments and attacks. Unlike many existing approaches, our work does not require the use of any parameters, bringing it closer to Dung’s work in spirit. We begin by introducing Fuzzy Argumentation Frameworks, and specialise them using the Gödel t-norm. We then examine this framework’s properties and show...

Journal: :Modeling and Analysis of Information Systems 2016

Journal: :Neurocomputing 2000
Gürsel Serpen David L. Livingston

A theorem which establishes the solutions of a given optimization problem as stable points in the state space of single-layer relaxation-type recurrent neural networks is proposed. This theorem establishes the necessary conditions for the neural network to converge to a solution by proposing certain values for the constraint weight parameters of the network. Convergence performance of the discr...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید