Results 121 to 130 of about 538 (171)

A formal approach to the hierarchical structures of microbial communities with negative interactions. [PDF]

Comput Struct Biotechnol J
Ruth B, Ibrahim B, Dittrich P.
europepmc   +1 more source

Comprehensive promotion of iPSC-CM maturation by integrating metabolic medium with nanopatterning and electrostimulation. [PDF]

Nat Commun
Li W, Luo X, Strano A, Arun S, Gamm O, Poetsch MS, Hasse M, Steiner RP, Fischer K, Pöche J, Ulbricht Y, Lesche M, Trimaglio G, El-Armouche A, Dahl A, Mirtschink P, Guan K, Schubert M.   +17 more
europepmc   +1 more source

Phylogenetic Diversity Indices from an Affine and Projective Viewpoint. [PDF]

Bull Math Biol
Moulton V, Spillner A, Wicke K.
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Shapovalov elements and Hasse diagrams

Theoretical and Mathematical Physics, 2023
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Algethami, D., Mudrov, A. I.
openaire   +2 more sources

Comparing Hasse diagrams

[Proceedings 1993] Second IEEE International Conference on Fuzzy Systems, 2002
The authors investigate the applicability of some relational strength measures when comparing and analyzing Hasse diagrams. The structures used were derived from a particular line of ongoing research that deals with human perception of an urban environment.
B.J.A. Juliano, W. Bandler
openaire   +1 more source

The Minimum Independence Number of a Hasse Diagram

Combinatorics, Probability and Computing, 2006
Let $P=(X,\le)$ be a finite partially ordered set. That is, $X$ is a finite ground set and $\le$ is a partial ordering on $X$ (a reflexive, transitive, and weakly antisymmetric relation).
Jirí Matousek 0001, Ales Prívetivý
openaire   +1 more source

Hasse Diagram Generators and Petri Nets

Fundamenta Informaticae, 2009
In [18] Lorenz and Juhás raised the question of whether there exists a suitable formalism for the representation of infinite families of partial orders generated by Petri nets. Restricting ourselves to bounded p/t-nets, we propose Hasse diagram generators as an answer. We show that Hasse diagram generators are expressive enough to represent the partial
openaire   +1 more source

A heuristic for task scheduling based on hasse diagram

2010 IEEE Fifth International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA), 2010
The problem of optimally mapping independent tasks onto heterogeneous machines such that the completion time of the last finishing task is minimized is NP-complete. Quite a lot of heuristics have been introduced to optimize the figure of merit. Among them, the algorithms HLTF (The Heterogeneous Largest Task First) and Segmented Min-Min have better ...
Qiushi Liang, Kenli Li 0001, Teklay Tesfazghi, Muying Li   +3 more
openaire   +1 more source