نتایج جستجو برای: basic cooperation graph

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

2013
Evgenia Hristova Maurice Grinberg Iskra Georgieva Milena Borisova

The paper aims to extend the findings of a previous study (Grinberg et al., 2012) exploring the impact of social relations on the cooperation in the Prisoner’s dilemma game. Relations between players are manipulated by assigning different roles. The roles embodied the four basic types of human relations in line with Fiske’s relational models theory (Fiske, 1991): communal sharing, authority ran...

Journal: :Biology letters 2009
Bernhard Voelkl Claudia Kasper

Animal cooperation has puzzled biologists for a long time as its existence seems to contravene the basic notion of evolutionary biology that natural selection favours 'selfish' genes that promote only their own well-being. Evolutionary game theory has shown that cooperators can prosper in populations of selfish individuals if they occur in clusters, interacting more frequently with each other t...

2009
Christian D Ott

We review the ensemble of anticipated gravitational-wave (GW) emission processes in stellar core collapse and postbounce core-collapse supernova evolution. We discuss recent progress in the modeling of these processes and summarize most recent GW signal estimates. In addition, we present new results on the GW emission from postbounce convective overturn and protoneutron star g-mode pulsations b...

2009
Peterson Trethewey Tobias Höllerer

We present two techniques for interactive graph layout manipulation which take inspiration from the fields of 3D modeling, mesh deformation, and static graph drawing. The first technique uses a multigrid method for modeling and animating large 3D meshes, the second employs ideas from a simpler mesh deformation scheme together with a basic graph searching algorithm and a user interface to contro...

2005
Maria Chudnovsky Paul D. Seymour

A graph is claw-free if no vertex has three pairwise nonadjacent neighbours. At first sight, there seem to be a great variety of types of claw-free graphs. For instance, there are line graphs, the graph of the icosahedron, complements of triangle-free graphs, and the Schläfli graph (an amazingly highly-symmetric graph with 27 vertices), and more; for instance, if we arrange vertices in a circle...

Design of some crystal and quasicrystal networks, based on rhombellane tiling,is presented. [1,1,1]Propellane,is a synthesized organic molecule; its hydrogenated form, the bicyclo[1.1.1]pentane,may be represented by the complete bipartite graph K2,3 which is the smallest rhombellane. Topology of translational and radial structures involving rhombellanes is described in terms of vertex symbol, c...

2011
Xin Wang Jing Han Huawei Han

Cooperation is ubiquitous in our real life but everyone would like to maximize her own profits. How does cooperation occur in the group of self-interested agents without centralized control? Furthermore, in a hostile scenario, for example, cooperation is unlikely to emerge. Is there any mechanism to promote cooperation if populations are given and play rules are not allowed to change? In this p...

2007
Enrique Alba Francisco Chicano

Model Checking is a well-known and fully automatic technique for checking software properties, usually given as temporal logic formulas on the program variables. Most of model checkers found in the literature use exact deterministic algorithms to check the properties. These algorithms usually require huge amounts of computational resources if the checked model is large. We propose here the use ...

Journal: :J. Comput. Syst. Sci. 1981
Lawrence Snyder

Models of protection in computer systems usually possess two components: a finite, labeled, directed two color graph representing the protection state of an operating system and a finite set of graph transformation rules with which the protection state may be changed. Harrison et al. demonstrated [ 1 ] that the safety problem for a very general protection model is undecidable; i.e., no algorith...

Journal: :Neurocomputing 2015
Fabricio A. Breve Liang Zhao Marcos G. Quiles

Semi-supervised learning methods are usually employed in the classification of data sets where only a small subset of the data items is labeled. In these scenarios, label noise is a crucial issue, since the noise may easily spread to a large portion or even the entire data set, leading to major degradation in classification accuracy. Therefore, the development of new techniques to reduce the na...

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

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