Results 91 to 100 of about 5,334 (178)

Algorithms for solving strong positional games with high symmetry [PDF]

open access: yes, 2012
In this thesis, we analyse several algorithms for solving strong positional games, mostly based on PN-search. We focus on games with high symmetry of the game plan, where it is possible to substantially reduce the partial game tree by joining isomorph ...
Novotná, Jitka
core  

Comparative transcriptomic analysis provides insights into the genetic networks regulating oil differential production in oil crops

open access: yesBMC Biology
Background Plants differ more than threefold in seed oil contents (SOCs). Soybean (Glycine max), cotton (Gossypium hirsutum), rapeseed (Brassica napus), and sesame (Sesamum indicum) are four important oil crops with markedly different SOCs and fatty acid
Jinwen Chen   +10 more
doaj   +1 more source

Split-Neighborhood Graphs and the Strong Perfect Graph Conjecture

open access: yes, 1995
We introduce the class of graphs such that every induced subgraph possesses a vertex whose neighbourhood can be split into a clique and a stable set. We prove that this class satisfies Berge′s strong perfect graph conjecture.
Maffray, F., Preissmann, M.
core   +1 more source

The Symptom Structure and Causal Relationships of Comorbid Anxiety and Depression Among Chinese Primary and Middle School Teachers: A Network Analysis

open access: yesPsychology Research and Behavior Management
Shumeng Ma, Ning Jia College of Education, Hebei Normal University, Shijiazhuang, People’s Republic of ChinaCorrespondence: Ning Jia, College of Education, Hebei Normal University, Shijiazhuang, 050024, People’s Republic of China, Email jianing@hebtu.edu.
Ma S, Jia N
doaj  

Identification of mitochondria-related biomarkers in childhood allergic asthma

open access: yesBMC Medical Genomics
Background The mechanism of mitochondria-related genes (MRGs) in childhood allergic asthma (CAS) was unclear. The aim of this study was to find new biomarkers related to MRGs in CAS.
Wei Zhao   +3 more
doaj   +1 more source

The Clique Width of Two Classes of Series-Parallel Digraphs<strong> </strong>

open access: yes
The concept of graphs with clique-width at most was first introduced by Courcelle et al.to be the graphs that can be characterized using -expressions derived from graph operations that use labels of vertices. If the clique-width for some graph is bounded then a grand number of algorithmic problems, in general NP-hard, can be solved in polynomial time
openaire   +1 more source

Reactive Local Search for Maximum Clique

open access: yes, 1997
A heuristic algorithm is proposed for the solution of the Maximum-Clique problem in graphs. The algorithm is based on local search complemented by a "reactive" (history--sensitive) scheme to determine the amount of diversification (Reactive ...
Roberto Battiti, Marco Protasi
core  

Social Media for Lifestyle Change – social with whom, and why? [PDF]

open access: yes, 2013
We have interviewed members of three different Twelve Step programs about how they manage their recovery in a long term perspective. This data also provides insight in the social aspects of the Twelve Step program.
Nylander, Stina
core  

Zero-one IP problems: Polyhedral descriptions & cutting plane procedures

open access: yes, 1994
A systematic way for tightening an IP formulation is by employing classes of linear inequalities that define facets of the convex hull of the feasible integer points of the respective problems.
Mitra, G, Yarrow, L, Abdul-Hamid, F
core  

Home - About - Disclaimer - Privacy