B-Tree Algorithm Complexity Analysis to Evaluate the Feasibility of its Application in the University Course Timetabling Problem [PDF]
Journal 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
Single‐molecule DNA flow‐stretch assays for high‐throughput DNA–protein interaction studies
FEBS 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
A Multi-Dimensional Matrix Product—A Natural Tool for Parameterized Graph Algorithms
, 2022 We introduce the concept of a k-dimensional matrix product D of k matrices A1,…,Ak of sizes n1×n,…,nk×n, respectively, where D[i1,…,ik] is equal to ∑ℓ=1nA1[i1,ℓ]×…×Ak[ik,ℓ].
Lingas, Andrzej +3 more
core +1 more source
Comparative assessment of crystallographic and cryo‐EM models in the Protein Data Bank
FEBS Open Bio, EarlyView.Raw data obtained by X‐ray crystallography or cryo‐EM result in experimental maps, ultimately fitted by atomic models. Although the physical principles are different, the final results can be viewed, compared, and evaluated in the same way. With cryogenic electron microscopy (cryo‐EM) on track to surpass X‐ray crystallography as the preferred method ...
Alexander Wlodawer +7 more
wiley +1 more source
Complexity analysis of primal-dual algorithms for the semidefinite linear complementarity problem
Journal of Numerical Analysis and Approximation Theory, 2011 In this paper a primal-dual path-following interior-point algorithm for the monotone semidefinite linear complementarity problem is presented. The algorithm is based on Nesterov-Todd search directions and on a suitable proximity for tracing approximately the central-path.
Mohamed Achache, Naima Boudiaf
openaire +3 more sources
Clustering Affine Subspaces: Algorithms and Hardness [PDF]
, 2012 We study a generalization of the famous k-center problem where each object is an affine subspace of dimension Δ, and give either the first or significantly improved algorithms and hardness results for many combinations of parameters.
Lee, Euiwoong
core +1 more source
Deep Learning Pose Estimation for Phenotyping of Co‐Occurring Hyperkinetic Movement Disorders
Annals of Clinical and Translational Neurology, EarlyView.ABSTRACT Objective To explore whether routine outpatient video combined with deep learning‐based pose estimation and clinically interpretable kinematic features can support multi‐label phenotyping of co‐occurring hyperkinetic movement disorders (HMDs).
Laura Cif +17 more
wiley +1 more source
Revisiting Online Algorithms: A Survey of Set Cover Solutions Beyond Competitive Analysis
IEEE AccessOnline algorithms are crucial for real-time decision-making and adaptability across diverse fields, such as operations research, computer science, and combinatorics. These algorithms handle data incrementally and make decisions without prior knowledge of
Christine Markarian +2 more
doaj +1 more source
Path Coverage Algorithm Based on Minimization of Sensor Movement Distance [PDF]
Jisuanji gongcheng, 2018 Most of existing algorithms for path coverage do not consider minimization of sensors movement distance.Aiming at this situation,this paper proves that the above mentioned problem is NP-hard,and presents a heuristic path covering algorithm.It moves ...
CHEN Xi,LIU Zhixiong
doaj +1 more source
Domination Analysis of Greedy Heuristics For The Frequency Assignment Problem [PDF]
, 2003 We introduce the greedy expectation algorithm for the fixed spectrum version of the frequency assignment problem. This algorithm was previously studied for the travelling salesman problem.
Noble, SD +6 more
core +1 more source