Results 71 to 80 of about 492,500 (284)
CluM: A Clustering–Cum–Markov model for resource prediction in a data center
International Journal of Applied Mathematics and Computer ScienceHigh-end data centers are required to process the user requests and provide them with a better quality of service. The prominent issues in building a sustainable data center are reduced carbon footprint, dynamic capacity planning to reduce resource ...
Govindarajan Madhupriya +2 more
doaj +1 more source
Research on Dynamic Data Stream Classification Algorithm with New Class
Jisuanji kexue yu tansuo, 2021 Aiming at the low performance in detecting new class of classification algorithm on dynamic data stream with new class, a completely randomized forest algorithm based on k-nearest neighbor (KCRForest) is proposed.
WU Weijie, ZHANG Jingxiang
doaj +1 more source
Randomized longest-queue-first scheduling for large-scale buffered systems [PDF]
, 2014 We develop diffusion approximations for parallel-queueing systems with the randomized longest-queue-first scheduling algorithm by establishing new mean-field limit theorems as the number of buffers $n\to\infty$.
Dieker, A. B., Suk, Tonghoon
core
Sampling and Reconstruction of Graph Signals via Weak Submodularity and Semidefinite Relaxation
, 2017 We study the problem of sampling a bandlimited graph signal in the presence of noise, where the objective is to select a node subset of prescribed cardinality that minimizes the signal reconstruction mean squared error (MSE).
Hashemi, Abolfazl +3 more
core +1 more source
FEBS Open Bio, EarlyView.In this study, we developed a deep learning method for mitotic figure counting in H&E‐stained whole‐slide images and evaluated its prognostic impact in 13 external validation cohorts from seven different cancer types. Patients with more mitotic figures per mm2 had significantly worse patient outcome in all the studied cancer types except colorectal ...
Joakim Kalsnes +32 more
wiley +1 more source
A Distributed Randomized Gradient-Free Algorithm for the Non-Convex Economic Dispatch Problem
Energies, 2018 In this paper, a distributed randomized gradient-free algorithm (DRGF) is employed to solve the complex non-convex economic dispatch problem whose non-convex constraints include valve-point loading effects, prohibited operating zones, and multiple fuel ...
Jun Xie, Qingyun Yu, Chi Cao
doaj +1 more source
FEBS Open Bio, EarlyView.This protocol paper outlines methods to establish the success of a time‐resolved serial crystallographic experiment, by means of statistical analysis of timepoint data in reciprocal space and models in real space. We show how to amplify the signal from excited states to visualise structural changes in successful experiments.
Jake Hill +4 more
wiley +1 more source
Efficient Implementation of Randomized Quantum Algorithms With Dynamic Circuits
IEEE Transactions on Quantum EngineeringRandomized algorithms are crucial subroutines in quantum computing, but the requirement to execute many types of circuits on a real quantum device has been challenging to their extensive implementation.
Shu Kanno +4 more
doaj +1 more source
A Rank-Two Feasible Direction Algorithm for the Binary Quadratic Programming
Journal of Applied Mathematics, 2013 Based on the semidefinite programming relaxation of the binary quadratic programming, a rank-two feasible direction algorithm is presented. The proposed algorithm restricts the rank of matrix variable to be two in the semidefinite programming relaxation ...
Xuewen Mu, Yaling Zhang
doaj +1 more source
Hybrid Feature Selection Approach Based on GRASP for Cancer Microarray Data
Journal of Computing and Information Technology, 2017 Microarray data usually contain a large number of genes, but a small number of samples. Feature subset selection for microarray data aims at reducing the number of genes so that useful information can be extracted from the samples. Reducing the dimension
Arpita Nagpal, Deepti Gaur
doaj +1 more source