Results 21 to 30 of about 1,195,901 (281)
On a combination of the 1-2-3 Conjecture and the Antimagic Labelling Conjecture [PDF]
Discrete Mathematics & Theoretical Computer Science, 2017 This paper is dedicated to studying the following question: Is it always possible to injectively assign the weights 1, ..., |E(G)| to the edges of any given graph G (with no component isomorphic to K2) so that every two adjacent vertices of G get ...
Julien Bensmail +2 more
doaj +1 more source
Meta-heuristic algorithms in car engine design: a literature survey [PDF]
, 2015 Meta-heuristic algorithms are often inspired by natural phenomena, including the evolution of species in Darwinian natural selection theory, ant behaviors in biology, flock behaviors of some birds, and annealing in metallurgy.
Tayarani-N, Mohammad-H. +2 more
core +2 more sources
Firefly Algorithms for Multimodal Optimization [PDF]
, 2009 Nature-inspired algorithms are among the most powerful algorithms for optimization. This paper intends to provide a detailed description of a new Firefly Algorithm (FA) for multimodal optimization applications.
Yang, Xin-She
core +1 more source
On locally irregular decompositions and the 1-2 Conjecture in digraphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2018 The 1-2 Conjecture raised by Przybylo and Wozniak in 2010 asserts that every undirected graph admits a 2-total-weighting such that the sums of weights "incident" to the vertices yield a proper vertex-colouring.
Olivier Baudon +3 more
doaj +1 more source
A general decomposition theory for the 1-2-3 Conjecture and locally irregular decompositions [PDF]
Discrete Mathematics & Theoretical Computer Science, 2019 How can one distinguish the adjacent vertices of a graph through an edge-weighting? In the last decades, this question has been attracting increasing attention, which resulted in the active field of distinguishing labellings.
Olivier Baudon +7 more
doaj +1 more source
Boolean lexicographic optimization: algorithms & applications [PDF]
, 2011 Multi-Objective Combinatorial Optimization (MOCO) problems find a wide range of practical application problems, some of which involving Boolean variables and constraints.
Argelich Romà, Josep +3 more
core +1 more source
The Arithmetic Optimization Algorithm
Computer Methods in Applied Mechanics and Engineering, 2021 Este trabajo propone un nuevo método metaheurístico llamado Algoritmo de Optimización Aritmética (AOA) que utiliza el comportamiento de distribución de los principales operadores aritméticos en matemáticas, incluyendo (Multiplicación (M), División (D), Resta (S) y Suma (A)).
Laith Abualigah +4 more
openaire +2 more sources
An evolutionary algorithm for multi-objective optimization of freshwater consumption in textile dyeing industry [PDF]
PeerJ Computer Science, 2022 Optimization is challenging even after numerous multi-objective evolutionary algorithms have been developed. Most of the multi-objective evolutionary algorithms failed to find out the best solutions spread and took more fitness evolution value to find ...
Ihsan Elahi +5 more
doaj +2 more sources
A Review on Energy Consumption Optimization Techniques in IoT Based Smart Building Environments [PDF]
, 2019 In recent years, due to the unnecessary wastage of electrical energy in residential buildings, the requirement of energy optimization and user comfort has gained vital importance.
Fayaz, Muhammad +4 more
core +2 more sources
Algorithmic GPGPU memory optimization [PDF]
2013 International SoC Design Conference (ISOCC), 2013 The performance of General-Purpose computation on Graphics Processing Units (GPGPU) is heavily dependent on the memory access behavior. In this paper, we present an algorithmic methodology to semi-automatically find the best mapping of memory accesses present in serial loop nest to underlying data-parallel architectures based on a comprehensive static ...
Byunghyun Jang, Minsu Choi, Kyung Ki Kim
openaire +1 more source