Results 51 to 60 of about 4,664 (221)

An investigation of resource-allocation decisions by means of project networks. [PDF]

open access: yes
This paper investigates the relationship between resource allocation and ES-policies, which are a type of scheduling policies introduced for stochastic scheduling and which can be represented by a directed acyclic graph.
Leus, Roel
core  

Synchronization-avoiding graph algorithms and runtime aspects [PDF]

open access: yes, 2018
Thesis (Ph.D.) - Indiana University, School of Informatics, Computing and Engineering, 2018Massively parallel computers provide unprecedented computing power that is only expected to grow.
Firoz, Jesun Sahariar
core  

Efficient Computation of the Shapley Value for Centrality in Networks

open access: yes, 2010
The Shapley Value is arguably the most important normative solution concept in coalitional games. One of its applications is in the domain of networks, where the Shapley Value is used to measure the relative importance of individual nodes.
Michalak, Tomasz P   +10 more
core   +1 more source

The Third‐Generation Magnetic Super‐Stable Mineralizer: Complete Removal and Separation of Multiple Heavy Metal Pollutants

open access: yesAdvanced Science, EarlyView.
The 3rd‐generation magnetic super‐stable mineralizer M‐MgAl‐700 features a core‐shell structure, strong superparamagnetism, large surface area, and abundant oxygen defects. It achieves exceptional Cd(II) and As(V) mineralization capacities, reducing both pollutants in co‐contaminated water and soil to meet national standards.
Haoran Wang   +9 more
wiley   +1 more source

An Automat for the semantic processing of structured information [PDF]

open access: yes, 2009
Using the database of the PuertoTerm project, an indexing system based on the cognitive model of Brigitte Enders was built. By analyzing the cognitive strategies of three abstractors, we built an automat that serves to simulate human indexing processes ...
Domínguez-Velasco, Sandor   +12 more
core   +1 more source

Natural Resistance to Ovarian Hyperstimulation Syndrome in Estrildid Finches Reveals Macrophage GPR183 as a Potential Therapeutic Target

open access: yesAdvanced Science, EarlyView.
Ovarian macrophage depletion reverses OHSS resistance in estrildid finches and exacerbates OHSS symptoms in rats. Activating macrophage GPR183 alleviates OHSS by reducing pro‐inflammatory factors, increasing immunomodulatory molecules, remodeling CD44/SDC4‐mediated communication, and restoring immune homeostasis.
Xiaofei Yan   +11 more
wiley   +1 more source

High-Performance Graph Algorithms (Dagstuhl Seminar 18241)

open access: yes, 2018
This report documents the program and outcomes of Dagstuhl Seminar 18241 ``High-performance Graph Algorithms''. The seminar reflected the ongoing qualitative change how graph algorithms are used in practice due to (i) the complex structure of graphs in
Peng, Richard   +2 more
core   +1 more source

Noninvasive Characterization of Tumor Heterogeneity in HNSCC: From Clinical Utility to Biological Correlates

open access: yesAdvanced Science, EarlyView.
This study establishes a CT‐based radiomics framework to quantify intratumoral heterogeneity (ITH) in HNSCC. Using unsupervised clustering, tumor ROIs and VOIs are analyzed to calculate 2D/3D ITH scores. The score shows strong predictive value for prognosis and immunotherapy response, and is associated with tumor metabolism and immune microenvironment,
Xinwei Chen   +15 more
wiley   +1 more source

How Advanced Artificial Intelligence Technologies Shape Drug–Drug and Drug–Target Interaction Modeling

open access: yesAdvanced Science, EarlyView.
This review explores the convergence of artificial intelligence technologies in modeling drug–drug and drug–target interactions. By evaluating advanced feature engineering, architectural innovations, and learning paradigms reveals shared evolutionary trends and critical challenges, such as cold‐start settings and shortcut learning.
Xin Sun, Tong Wang
wiley   +1 more source

Fast reoptimization for the minimum spanning tree problem [PDF]

open access: yes, 2010
We study reoptimization versions of the minimum spanning tree problem. The reoptimization setting can generally be formulated as follows: given an instance of the problem for which we already know some optimal solution, and given some “small ...
Paschos, Vangelis Th.   +4 more
core   +1 more source

Home - About - Disclaimer - Privacy