Results 71 to 80 of about 1,231,038 (365)
Better polynomial algorithms for scheduling unit-length jobswith bipartite incompatibility graphs on uniform machines [PDF]
Bulletin of the Polish Academy of Sciences: Technical Sciences, 2019 The goal of this paper is to explore and to provide tools for the investigation of the problems of unit-length scheduling of incompatible jobs on uniform machines. We present two new algorithms that are a significant improvement over the known algorithms.
T. Pikies, M. Kubale
doaj +1 more source
Scheduling algorithms for the lock scheduling problem
Procedia - Social and Behavioral Sciences, 2011 AbstractIn the present contribution we will show that scheduling a lock having at least two identical chambers requires solving the identical parallel machine scheduling problem with unit processing times, release dates and sequence dependent setup times.
Patrick De Causmaecker +2 more
openaire +2 more sources
Identification of novel small molecule inhibitors of ETS transcription factors
FEBS Letters, EarlyView.ETS transcription factors play an essential role in tumourigenesis and are indispensable for sprouting angiogenesis, a hallmark of cancer, which fuels tumour expansion and dissemination. Thus, targeting ETS transcription factor function could represent an effective, multifaceted strategy to block tumour growth. The evolutionarily conserved E‐Twenty‐Six
Shaima Abdalla +9 more
wiley +1 more source
Secrecy Outage and Diversity Analysis of Cognitive Radio Systems
, 2014 In this paper, we investigate the physical-layer security of a multi-user multi-eavesdropper cognitive radio system, which is composed of multiple cognitive users (CUs) transmitting to a common cognitive base station (CBS), while multiple eavesdroppers ...
Li, Xuelong +2 more
core +1 more source
, 2022 Background: Heart failure (HF) is a multi-morbid chronic condition, which adversely affects the quality of life of the affected individual. Engaging the patient and their caregivers in self-care is known to reduce mortality, rehospitalisation and improve quality of life among HF patients. The PACT-HF trial will answer whether clinical benefits in terms
Harikrishnan, Sivadasanpillai +3 more
openaire +1 more source
The Saccharomyces cerevisiae amino acid transporter Lyp1 has a broad substrate spectrum
FEBS Letters, EarlyView.In Saccharomyces cerevisiae, Yeast Amino acid Transporter family members mediate the import of amino acids, ranging from substrate specialists to generalists. Here, we show that the specialist transporter, Lyp1, has a broader substrate spectrum than previously described, with affinity constants spanning from micromolar to millimolar.
Foteini Karapanagioti +3 more
wiley +1 more source
PGGA: A predictable and grouped genetic algorithm for job scheduling [PDF]
, 2006 This paper presents a predictable and grouped genetic algorithm (PGGA) for job scheduling. The novelty of the PGGA is twofold: (1) a job workload estimation algorithm is designed to estimate a job workload based on its historical execution records, (2 ...
Li, M, Qi, M, Yu, B
core
A Two-Phase Scheme for Distributed TDMA Scheduling in WSNs with Flexibility to Trade-off between Schedule Length and Scheduling Time [PDF]
arXiv, 2019 The existing distributed TDMA-scheduling techniques can be classified as either static or dynamic. The primary purpose of static TDMA-scheduling algorithms is to improve the channel utilization by generating a schedule of shorter length. But, they usually take a longer time to schedule, and hence, are not suitable for WSNs, in which the network ...
arxiv
Scheduling in Grid Computing Environment [PDF]
, 2014 Scheduling in Grid computing has been active area of research since its beginning. However, beginners find very difficult to understand related concepts due to a large learning curve of Grid computing. Thus, there is a need of concise understanding of scheduling in Grid computing area.
arxiv +1 more source
Discrete Applied Mathematics, 1996 AbstractConsider a set of circles of the same length and r irregular polygons with vertices on a circle of this length. Each of the polygons has to be arranged on a given subset of all circles and the positions of the polygon on the different circles are depending on each other.
openaire +2 more sources