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

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

Journal: :Electr. Notes Theor. Comput. Sci. 2006
Hartmut Ehrig Karsten Ehrig

In this paper we give an overview of formal concepts for model transformations between visual languages based on typed attributed graph transformation. We start with a basic concept where visual languages are defined by attributed type graphs only and model transformations by basic typed attributed graph transformation systems. We continue with different kinds of extensions of the basic concept...

2007
Adriaan Peeters Kris Coolsaet Gunnar Brinkmann Nicolas Van Cleemput Veerle Fack

The GrInvIn framework provides the core functionality needed to implement an application for graph theory in general. It includes basic functionality to work with graphs, invariants, and conjectures. In addition to data structures and interfaces for these concepts, the framework also provides a basic graph editor, various invariant computing routines, and an intuitive graphical user interface. ...

2001
Frank Hanisch

Highly interactive Web-based courseware allows for a more intuitive learning than nowadays textbooks. A high level of interaction and cooperation is crucial for the success in stirring up the participants’ emotions and involving him into self-acting studies. The basic requirements for the underlying programming architecture are interdisciplinary. We describe a general framework for rapid develo...

2007
Matthias Grünewald Tamás Lukovszki Christian Schindelhauer Klaus Volbert

Multiple hop routing in mobile ad hoc networks can minimize energy consumption and increase data throughput. Yet, the problem of radio interferences remains. However if the routes are restricted to a basic network based on local neighborhoods, these interferences can be reduced such that standard routing algorithms can be applied. We compare different network topologies for these basic networks...

2002
Matthias Grünewald Tamás Lukovszki Christian Schindelhauer Klaus Volbert

Multiple hop routing in mobile ad hoc networks can minimize energy consumption and increase data throughput. Yet, the problem of radio interferences remains. However if the routes are restricted to a basic network based on local neighborhoods, these interferences can be reduced such that standard routing algorithms can be applied. We compare different network topologies for these basic networks...

Journal: تعلیم و تربیت 2014
,

Children's Rights and the New Evaluation Approach in Iran M. Hassani, Ph.D. Schools are among highly valued social institutions wherein the new generations' way to progress is paved. As such, they must operate in a way that promotes and protects children's basic rights. One area of operation in schools is evaluation. Hence, it too needs to be in accordance with the children's rights c...

2009
Mohammad Akbarpour Reza Nasiri Mahalati Caro Lucas

The existence of many biological systems, especially human societies, is based on cooperative behavior [1, 2]. If natural selection favors selfish individuals, then what mechanism is at work that we see so many cooperative behaviors? One answer is the effect of network structure. On a graph, cooperators can evolve by forming network bunches [2, 3, 4]. In a research, Ohtsuki et al used the idea ...

2010
Ulf Bernitz

1 Scandinavian Studies in Law 50 Years ................................................. 14 2 The Themes of the Article ...................................................................... 15 3 Scandinavian or Nordic Law? Terminology and Basic Legal Setting ................................................................................. 15 4 The Classification of Scandinavian Law Within the ...

خنجری, صدیقه, حمید حقانی, , صدیقه عاصمی, , فاطمه داوری, ,

 With dramatic increasing number of sudden deaths from coronary artery diseases and the importance of time saving in those with cardiac arrest, public teaching about basic resuscitation is a vital issue.   So, to assess the impact of basic cardiopulmonary resuscitation training on knowledge and skill level of grade 3 high school students, a quasi-experimental study with 90 subjects of case and ...

The vertex-edge Wiener polynomials of a simple connected graph are defined based on the distances between vertices and edges of that graph. The first derivative of these polynomials at one are called the vertex-edge Wiener indices. In this paper, we express some basic properties of the first and second vertex-edge Wiener polynomials of simple connected graphs and compare the first and second ve...

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

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