Results 51 to 60 of about 148,724 (314)
B-Tree Algorithm Complexity Analysis to Evaluate the Feasibility of its Application in the University Course Timetabling Problem [PDF]
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
The dual roles of CC and CXC chemokines in distinguishing active, latent, and subclinical tuberculosis were reviewed, along with an evaluation of their potential as diagnostic biomarkers and therapeutic targets to advance precision medicine in tuberculosis management. The graphical abstract was generated with AI assistance (Gemini 3.0).
Xuying Yin, Dangsheng Xiao, Jiezuan Yang
wiley +1 more source
METHODS OF SOLVING THE PATTERN RECOGNITION PROBLEM USING RESIDUE NUMBER SYSTEM
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
Intelligent Tutoring Systems for Adult Learning in STEM Disciplines
ABSTRACT Intelligent tutoring systems (ITS) are reshaping adult learning in STEM by providing adaptive, data‐driven instruction across classrooms, workplaces, and informal environments. In the context of ITS, this article compares generative AI, which creates personalized explanations and practice materials, with explainable AI, which focuses on ...
Jill Zarestky, Amanda R. Lager Gleason
wiley +1 more source
This paper addresses the problem of decoding non-binary low density parity check codes(LDPC) over finite field $GF(q)$ using symbol flipping approach.
Waheed Ullah +2 more
doaj +1 more source
Coalition structure generation over graphs [PDF]
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
ABSTRACT Mental well‐being is central to adult learner success, yet many adult education institutions lack capacity to provide timely and accessible support. This article examines how artificial intelligence (AI) can strengthen mental health–adjacent supports in adult and continuing higher education, with attention to professional practice and ...
Adam L. McClain, Thomas Wade
wiley +1 more source
Performance Analysis of Wavenumber Domain Algorithms for Highly Squinted SAR
Wavenumber domain algorithms have unique advantages in processing highly squinted synthetic aperture radar data. This article studies the performance of three commonly used wavenumber domain algorithms including the classical wavenumber domain (CWD ...
Xing Chen +3 more
doaj +1 more source
On Evaluating Human Problem Solving of Computationally Hard Problems
This article is concerned with how computer science, and more exactly computational complexity theory, can inform cognitive science. In particular, we suggest factors to be taken into account when investigating how people deal with computational hardness.
Stege, Ulrike, Carruthers, Sarah
core +1 more source
Efficient algorithms for generalized Stable Marriage and Roommates problems [PDF]
We consider a generalization of the Stable Roommates problem (SR), in which preference lists may be partially ordered and forbidden pairs may be present, denoted by SRPF.
Irving, R.W. +5 more
core +1 more source

