Results 21 to 30 of about 10,333,076 (321)
Synthesizing optimal collective algorithms [PDF]
Proceedings of the 26th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2021 Both Zixian Cai and Zhengyang Liu contributed equally to the paper. The work was done during internships at Microsoft Research.
Cai, Zixian +6 more
openaire +2 more sources
Backbone colouring and algorithms for TDMA scheduling [PDF]
Discrete Mathematics & Theoretical Computer Science, 2019 We investigate graph colouring models for the purpose of optimizing TDMA link scheduling in Wireless Networks. Inspired by the BPRN-colouring model recently introduced by Rocha and Sasaki, we introduce a new colouring model, namely the BMRN-colouring ...
Julien Bensmail +4 more
doaj +1 more source
Computing metric hulls in graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2019 We prove that, given a closure function the smallest preimage of a closed set can be calculated in polynomial time in the number of closed sets. This implies that there is a polynomial time algorithm to compute the convex hull number of a graph, when all
Kolja Knauer, Nicolas Nisse
doaj +1 more source
Improper colouring of (random) unit disk graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 For any graph $G$, the $k$-improper chromatic number $χ ^k(G)$ is the smallest number of colours used in a colouring of $G$ such that each colour class induces a subgraph of maximum degree $k$.
Ross J. Kang +2 more
doaj +1 more source
An optimal permutation routing algorithm on full-duplex hexagonal networks [PDF]
Discrete Mathematics & Theoretical Computer Science, 2008 Distributed Computing and ...
Ignasi Sau, Janez Žerovnik
doaj +1 more source
Adaptive Cut Selection in Mixed-Integer Linear Programming
Open Journal of Mathematical Optimization, 2023 Cutting plane selection is a subroutine used in all modern mixed-integer linear programming solvers with the goal of selecting a subset of generated cuts that induce optimal solver performance.
Turner, Mark +3 more
doaj +1 more source
A Comparison of Optimization Algorithms for Deep Learning [PDF]
International journal of pattern recognition and artificial intelligence, 2020 In recent years, we have witnessed the rise of deep learning. Deep neural networks have proved their success in many areas. However, the optimization of these networks has become more difficult as neural networks going deeper and datasets becoming bigger.
Derya Soydaner
semanticscholar +1 more source
Progress in mathematical programming solvers from 2001 to 2020
EURO Journal on Computational Optimization, 2022 This study investigates the progress made in lp and milp solver performance during the last two decades by comparing the solver software from the beginning of the millennium with the codes available today.
Thorsten Koch +3 more
doaj +1 more source
A method for eternally dominating strong grids [PDF]
Discrete Mathematics & Theoretical Computer Science, 2020 In the eternal domination game, an attacker attacks a vertex at each turn and a team of guards must move a guard to the attacked vertex to defend it. The guards may only move to adjacent vertices and no more than one guard may occupy a vertex.
Alizée Gagnon +7 more
doaj +1 more source
Detection number of bipartite graphs and cubic graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2014 For a connected graph G of order |V(G)| ≥3 and a k-labelling c : E(G) →{1,2,…,k} of the edges of G, the code of a vertex v of G is the ordered k-tuple (ℓ1,ℓ2,…,ℓk), where ℓi is the number of edges incident with v that are labelled i. The k-labelling c is
Frederic Havet +2 more
doaj +1 more source