Results 31 to 40 of about 2,251 (141)
Self-complementary hypergraphs and their self-complementing permutations
Electronic Notes in Discrete Mathematics, 2006 Abstract A k –uniform hypergraph H = ( V ; E ) is called self-complementary if there is a permutation σ : V → V , called self-complementing , such that for every k –subset e of V , e ∈ E if and only if σ ( e ) ∉ E . In other words, H is isomorphic with H ′ = ( V ; ( V k ) −
Artur Szymański, A. Paweł Wojda
openaire +1 more source
Toward a Formal Semantics for Autonomic Components [PDF]
, 2008 Autonomic management can improve the QoS provided by parallel/ distributed applications. Within the CoreGRID Component Model, the autonomic management is tailored to the automatic - monitoring-driven - alteration of the component assembly and, therefore,
JO Kephart +3 more
core +2 more sources
Balanced walls for random groups [PDF]
, 2015 We study a random group G in the Gromov density model and its Cayley complex X. For density < 5/24 we define walls in X that give rise to a nontrivial action of G on a CAT(0) cube complex.
Mackay, John M., Przytycki, Piotr
core +2 more sources
Combinatorics and geometry of finite and infinite squaregraphs
, 2009 Squaregraphs were originally defined as finite plane graphs in which all inner faces are quadrilaterals (i.e., 4-cycles) and all inner vertices (i.e., the vertices not incident with the outer face) have degrees larger than three.
David Eppstein +4 more
core +2 more sources
On the heterochromatic number of hypergraphs associated to geometric graphs and to matroids
, 2010 The heterochromatic number hc(H) of a non-empty hypergraph H is the smallest integer k such that for every colouring of the vertices of H with exactly k colours, there is a hyperedge of H all of whose vertices have different colours.
A. García +6 more
core +1 more source
Pseudo Random Coins Show More Heads Than Tails
, 2004 Tossing a coin is the most elementary Monte Carlo experiment. In a computer the coin is replaced by a pseudo random number generator. It can be shown analytically and by exact enumerations that popular random number generators are not capable of ...
Bauke, Heiko, Mertens, Stephan
core +1 more source
Total Domishold Graphs: a Generalization of Threshold Graphs, with Connections to Threshold Hypergraphs [PDF]
, 2013 A total dominating set in a graph is a set of vertices such that every vertex of the graph has a neighbor in the set. We introduce and study graphs that admit non-negative real weights associated to their vertices such that a set of vertices is a total ...
Chiarelli, Nina, Milanic, Martin
core +1 more source
Leveraging Artificial Intelligence and Large Language Models for Cancer Immunotherapy
Advanced Science, EarlyView.Cancer immunotherapy faces challenges in predicting treatment responses and understanding resistance mechanisms. Artificial intelligence (AI) and machine learning (ML) offer powerful solutions for cancer immunotherapy in patient stratification, biomarker discovery, treatment strategy optimization, and foundation model development.
Xinchao Wu +4 more
wiley +1 more source
Generalized Satisfiability Problems via Operator Assignments
, 2017 Schaefer introduced a framework for generalized satisfiability problems on the Boolean domain and characterized the computational complexity of such problems. We investigate an algebraization of Schaefer's framework in which the Fourier transform is used
A Acín +12 more
core +1 more source
, 2014 In most natural and engineered systems, a set of entities interact with each other in complicated patterns that can encompass multiple types of relationships, change in time, and include other types of complications.
Arenas, Alexandre +5 more
core +1 more source