Results 331 to 340 of about 2,687,568 (346)
Some of the next articles are maybe not open access.
Genome trees and the tree of life
Trends in Genetics, 2002Genome comparisons indicate that horizontal gene transfer and differential gene loss are major evolutionary phenomena that, at least in prokaryotes, involve a large fraction, if not the majority, of genes. The extent of these events casts doubt on the feasibility of constructing a 'Tree of Life', because the trees for different genes often tell ...
Igor B. Rogozin +3 more
openaire +3 more sources
SSRN Electronic Journal, 2002 Abstract In this paper we contrast the main workhorse model in asset pricing theory, the Lucas (1978) tree model (LT-Model), to a benchmark model in financial equilibrium theory, the real assets model (RA-Model). It is commonly believed that the two models entail similar conclusions since the LT-Model is a special case of the RA-Model.
Anna Pavlova, Anna Pavlova, David Cass
openaire +5 more sources
Mathematics Magazine, 2006
ture game Trinity, you have a gnomon you must screw into a hole?but the threads in the hole are going the wrong way. Wandering about, you encounter an "abstract sculpture," inscribed with the words Felix Klein 1849-1925. Nearby are strange leafy tunnels.
openaire +2 more sources
ture game Trinity, you have a gnomon you must screw into a hole?but the threads in the hole are going the wrong way. Wandering about, you encounter an "abstract sculpture," inscribed with the words Felix Klein 1849-1925. Nearby are strange leafy tunnels.
openaire +2 more sources
2017
This chapter considers the problem of counting trees. Every connected graph G has a spanning tree, that is, a connected acyclic subgraph containing all the vertices of G. If G has no cycles, it is its own unique spanning tree. If G has cycles, we can locate any cycle and delete one of its edges. Repeat this process until no cycle remains.
openaire +1 more source
This chapter considers the problem of counting trees. Every connected graph G has a spanning tree, that is, a connected acyclic subgraph containing all the vertices of G. If G has no cycles, it is its own unique spanning tree. If G has cycles, we can locate any cycle and delete one of its edges. Repeat this process until no cycle remains.
openaire +1 more source
, 1965 This thesis consists of a number of original stories and poems. The works attempt, in experimental forms, to portray certain basic human dilemmas in order to communicate their social, political, psychological or philosophical aspects. "The Butternut Tree" deals with different sets of relationships, some severed forcefully though desired, others forced ...
openaire +1 more source
Rooted-tree solutions for tree games
European Journal of Operational Research, 2010Abstract In this paper, we study cooperative games with limited cooperation possibilities, represented by a tree on the set of agents. Agents in the game can cooperate if they are connected in the tree. We introduce natural extensions of the average (rooted)-tree solution (see [Herings, P., van der Laan, G., Talman, D., 2008.
Béal, Sylvain +2 more
openaire +4 more sources
Fault trees, event trees and success trees
1993Fault-tree analysis was developed by H.A. Watson of the Bell Telephone Laboratories in 1961–2 as part of a US Air Force study contract for the Minuteman missile launch control system. Through the years it has proved to be a very valuable tool for the reliability evaluation of complex systems, such as nuclear power stations, chemical plants, wide-body ...
A. Bossche, D. J. Sherwin
openaire +2 more sources