Results 11 to 20 of about 1,195,901 (281)

Algorithmic lifestyle optimization

open access: yesJournal of the American Medical Informatics Association, 2022
Abstract Objective A hallmark of personalized medicine and nutrition is to identify effective treatment plans at the individual level. Lifestyle interventions (LIs), from diet to exercise, can have a significant effect over time, especially in the case of food intolerances and allergies. The large set
Ameen Eetemadi, Ilias Tagkopoulos
openaire   +4 more sources

Hippopotamus Optimization Algorithm: A Novel Nature-Inspired Optimization Algorithm

open access: yesScientific Reports, 2023
Abstract The novelty of this article lies in introducing a novel nonparametric metaheuristic technique named the Hippopotamus Optimization (HO) algorithm. The HO is conceived by drawing inspiration from the inherent behaviors observed in hippopotamuses, showcasing an innovative approach in metaheuristic methodology.
Mohammad Hussein Amiri   +4 more
openaire   +3 more sources

Zebra Optimization Algorithm: A New Bio-Inspired Optimization Algorithm for Solving Optimization Algorithm

open access: yesIEEE Access, 2022
In this paper, a new bio-inspired metaheuristic algorithm called Zebra Optimization Algorithm (ZOA) is developed; its fundamental inspiration is the behavior of zebras in nature. ZOA simulates the foraging behavior of zebras and their defense strategy against predators’ attacks. The ZOA steps are described and then mathematically modeled.
Eva Trojovska   +2 more
openaire   +2 more sources

Instance-Optimal Geometric Algorithms [PDF]

open access: yesJournal of the ACM, 2009
We prove the existence of an algorithm A for computing 2D or 3D convex hulls that is optimal for every point set in the following sense: for every sequence σ of n points and for every algorithm A ′ in a certain class A ...
Afshani, Peyman   +2 more
openaire   +5 more sources

Synthesizing optimal collective algorithms [PDF]

open access: yesProceedings 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

An optimal permutation routing algorithm on full-duplex hexagonal networks [PDF]

open access: yesDiscrete 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 access: yesOpen 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 method for eternally dominating strong grids [PDF]

open access: yesDiscrete 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

Progress in mathematical programming solvers from 2001 to 2020

open access: yesEURO 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

Detection number of bipartite graphs and cubic graphs [PDF]

open access: yesDiscrete 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

Home - About - Disclaimer - Privacy