Results 31 to 40 of about 84 (76)

The least square values and the shapley value for cooperative TU games

open access: yes
Cooperative TU games, Shapley value, least square values, average per capita formula, potential basis, inverse problem, 90B05, 90B10,
Irinel Dragan
core   +1 more source

Rare-earth—gallium—iron glasses. I. Magnetic ordering and hysteresis in alloys based on Gd, Tb, and Er [PDF]

open access: yes, 1984
Results of magnetic measurements are presented on the new metallic glass systems (R80Ga20)100-xFex and (R80Ga20)90B10, where R denotes the heavy rare earths Gd, Tb, and Er, for x=10, 20, and 30, respectively.
Cornelison, S.G., Sellmyer, David J.
core  

MOSCOW MATHEMATICAL JOURNAL Volume 1, Number 3, July–September 2001, Pages 407–419 STEADY SOLUTIONS FOR FIFO NETWORKS

open access: yes, 2008
Dedicated to Robert Minlos on the occasion of his 70 th birthday Abstract. We consider the fluid model of a reentrant line with FIFO discipline and look for solutions with constant flows (steady solutions).
K. Khanin   +3 more
core  

Dynamical behaviour of ultrathin [CoFeB (tCoFeB)/Pd] films with perpendicular magnetic anisotropy. [PDF]

open access: yesSci Rep, 2021
Silva AS   +7 more
europepmc   +1 more source

Stackelberg Solutions in an Opinion Dynamics Game with Stubborn Agents

open access: yes
The paper examines an opinion dynamics game in a social group with two active agents (influencers) based on the Friedkin–Johnsen model. In the game, we assume sequential announcements of influence efforts by the active agents on the opinions of other ...
Yulia Kareeva   +2 more
core   +1 more source

P A FUZZY CRITICAL PATH PROBLEM FOR PROJECT NETWORK

open access: yes, 2013
: The task of finding the crisp critical path has received researcher's attention over the past two decades which has wide range of applications in planning and scheduling the large projects. In most cases of our life, the data obtained for decision
S Elizabeth, L Sujatha
core  

Interior Point Algorithms For Network Flow Problems

open access: yes, 1996
. Computational algorithms for the solution of network flow problems are of great practical significance. In the last decade, a new class of computationally efficient algorithms, based on the interior point method, has been proposed and applied to solve ...
Mauricio G.C. Resende, Panos M. Pardalos
core  

Home - About - Disclaimer - Privacy