Results 21 to 30 of about 85,241 (257)
Combinatorial Dominance Guarantees for Heuristic Algorithms [PDF]
Discrete Mathematics & Theoretical Computer Science, 2007 An $f(n)$ $\textit{dominance bound}$ on a heuristic for some problem is a guarantee that the heuristic always returns a solution not worse than at least $f(n)$ solutions.
Daniel Berend +2 more
doaj +1 more source
Greedy Algorithms for Optimal Distribution Approximation
Entropy, 2016 The approximation of a discrete probability distribution t by an M-type distribution p is considered. The approximation error is measured by the informational divergence D ( t ∥ p ) , which is an appropriate measure, e.g., in the ...
Bernhard C. Geiger, Georg Böcherer
doaj +1 more source
Scalability of Betweenness Approximation Algorithms: An Experimental Review
IEEE Access, 2019 Betweenness centrality, which measures the contribution of an individual node to the network's connectivity by counting the number of shortest paths a node appears in, is widely used for the analysis of the complex networks.
Sebastian Wandelt +2 more
doaj +1 more source
CES Transactions on Electrical Machines and Systems, 2022 The calculation of square roots is a frequently used operation in control systems of power electronics for different applications: motor drives, power converters, etc. At the same time, the execution of this procedure significantly loads microcontrollers
Anton Dianov +2 more
doaj +1 more source
Transitivity Demolition and the Fall of Social Networks
IEEE Access, 2017 In this paper, we study crucial elements of a complex network, namely its nodes and connections, which play a key role in maintaining the network's structure and function under unexpected structural perturbations of nodes and edges removal. Specifically,
Hung T. Nguyen +4 more
doaj +1 more source
Edit Distance with Block Deletions
Algorithms, 2011 Several variants of the edit distance problem with block deletions are considered. Polynomial time optimal algorithms are presented for the edit distance with block deletions allowing character insertions and character moves, but without block moves.
Dana Shapira, James A. Storer
doaj +1 more source
Influence Circle Covering in Large-Scale Social Networks: A Shift Approach
IEEE Access, 2021 Given a specific propagation speed $h$ in a social network $G(V, E)$ , an influence circle(IC) of a node $s$ in time $t$ is a node set of its influenced nodes, where the distance between $s$ and its expected influenced node $w$ is less than ...
Wangjun Ying, Jian Xu
doaj +1 more source
Connected bin packing problem on traceable graphs [PDF]
Iranian Journal of Numerical Analysis and Optimization, 2022 We consider a new extension of the bin packing problem in which a set of connectivity constraints should be satisfied. An undirected graph with a weight function on the nodes is given.
A. Nejoomi, A. Dolati
doaj +1 more source
Coresets for the Average Case Error for Finite Query Sets
Sensors, 2021 Coreset is usually a small weighted subset of an input set of items, that provably approximates their loss function for a given set of queries (models, classifiers, hypothesis). That is, the maximum (worst-case) error over all queries is bounded.
Alaa Maalouf +3 more
doaj +1 more source
New Bipartite Graph Techniques for Irregular Data Redistribution Scheduling
Algorithms, 2019 For many parallel and distributed systems, automatic data redistribution improves its locality and increases system performance for various computer problems and applications.
Qinghai Li, Chang Wu Yu
doaj +1 more source