Results 41 to 50 of about 149,618 (314)

Fifty years of scheduling: a survey of milestones [PDF]

open access: yes, 2009
Scheduling has become a major field within operational research with several hundred publications appearing each year. This paper explores the historical development of the subject since the mid 1950s when the landmark publications started to appear.
Strusevich, Vitaly A.   +5 more
core   +1 more source

Hybrid Deep Reinforcement Learning Considering Discrete-Continuous Action Spaces for Real-Time Energy Management in More Electric Aircraft

open access: yesEnergies, 2022
The increasing number and functional complexity of power electronics in more electric aircraft (MEA) power systems have led to a high degree of complexity in modelling and computation, making real-time energy management a formidable challenge, and the ...
Bing Liu   +4 more
doaj   +1 more source

Analysis of solving methods and complexity of algorithmics problems in Lithuanian and Baltic Olympiads

open access: yesLietuvos matematikos rinkinys, 2003
Lithuanian Olympiads in Informatics are being organized since 1990. Each Olympiad consists of three rounds. The final (national) one is divided into two parts, there are also elder and younger divisions. Each year there are supplied a lot of tasks. The paper deals with algorithmic problems of all the Lithuanian olympiads of school students and all the ...
Valentina Dagienė, Jūratė Skūpienė
openaire   +2 more sources

B-Tree Algorithm Complexity Analysis to Evaluate the Feasibility of its Application in the University Course Timetabling Problem [PDF]

open access: yesJournal of Artificial Intelligence and Soft Computing Research, 2013
Abstract This paper presents a comparative analysis of complexity between the B-TREE and the Binary Search Algorithms, both theoretically and experimentally, to evaluate their efficiency in finding overlap of classes for students and teachers in the University Course Timetabling Problem (UCTP).
Marco Antonio Cruz Chvez   +1 more
openaire   +1 more source

Somatic mutational landscape in von Hippel–Lindau familial hemangioblastoma

open access: yesMolecular Oncology, EarlyView.
The causes of central nervous system (CNS) hemangioblastoma in Von Hippel–Lindau (vHL) disease are unclear. We used Whole Exome Sequencing (WES) on familial hemangioblastoma to investigate events that underlie tumor development. Our findings suggest that VHL loss creates a permissive environment for tumor formation, while additional alterations ...
Maja Dembic   +5 more
wiley   +1 more source

METHODS OF SOLVING THE PATTERN RECOGNITION PROBLEM USING RESIDUE NUMBER SYSTEM

open access: yesНаука. Инновации. Технологии, 2022
The paper proposes a possibility of implementing algorithms of solving the pattern recognition problem in the Residue Number System. Considered the most advanced information processing algorithms in the Residue Number System and performed their ...
Nikolay Ivanovich Chervyakov   +2 more
doaj  

Single‐cell DNA methylation profiling: Technologies, computation, and applications in precision oncology

open access: yesMolecular Oncology, EarlyView.
Single‐cell DNA methylation (scDNAme) profiling maps epimutational clonal evolution, revealing mechanisms of malignancy and therapeutic resistance across diverse cancer types. By providing a high‐resolution landscape of intratumoral heterogeneity, these technologies empower precise patient stratification, guide the development of enhanced ...
Ik Soo Kim
wiley   +1 more source

Single‐molecule DNA flow‐stretch assays for high‐throughput DNA–protein interaction studies

open access: yesFEBS Open Bio, EarlyView.
We describe an optimised single‐molecule DNA flow‐stretch assay that visualises DNA–protein interactions in real time. Linear DNA fragments are tethered to a surface and stretched by buffer flow for fluorescence imaging. Using λ and φX174 DNA, this protocol enhances reproducibility and accessibility, providing a versatile approach for studying diverse ...
Ayush Kumar Ganguli   +8 more
wiley   +1 more source

Coalition structure generation over graphs [PDF]

open access: yes, 2012
We give the analysis of the computational complexity of coalition structure generation over graphs. Given an undirected graph G = (N,E) and a valuation function v : P(N) → R over the subsets of nodes, the problem is to find a partition of N into ...
Polukarov, Maria   +5 more
core   +1 more source

A Comparison of Security and its Performance for Key Agreements in Post-Quantum Cryptography

open access: yesIEEE Access, 2020
Nowadays, we are surrounded by devices collecting and transmitting private information. Currently, the two main mathematical problems that guarantee security on the Internet are the Integer Factorization Problem and the Discrete Logarithm Problem ...
Fabio Borges   +2 more
doaj   +1 more source

Home - About - Disclaimer - Privacy