Results 41 to 50 of about 7,400,710 (384)
A Methodology for Classifying Search Operators as Intensification or Diversification Heuristics
Complexity, 2020 Selection hyper-heuristics are generic search tools that dynamically choose, from a given pool, the most promising operator (low-level heuristic) to apply at each iteration of the search process. The performance of these methods depends on the quality of
Jorge A. Soria-Alcaraz +5 more
doaj +1 more source
Route Stability in the Uncertain Capacitated Arc Routing Problem
Frontiers in Energy Research, 2022 Power line inspections in a microgrid can be modeled as the uncertain capacitated arc routing problem, which is a classic combinatorial optimization problem.
Yuxin Liu +3 more
doaj +1 more source
Wigner Functions on a Lattice [PDF]
, 2000 The Wigner functions on the one dimensional lattice are studied. Contrary to the previous claim in literature, Wigner functions exist on the lattice with any number of sites, whether it is even or odd.
A.M.F. Rivas +20 more
core +2 more sources
, 2007 We study the performances of stochastic heuristic search algorithms on Uniquely Extendible Constraint Satisfaction Problems with random inputs. We show that, for any heuristic preserving the Poissonian nature of the underlying instance, the (heuristic ...
Connamacher H +7 more
core +2 more sources
Automatic assessment of creativity in heuristic problem-solving based on query diversity [PDF]
, 2017 Indexación: Web of Science; Scopus.Research, development and innovation are the pillars on which companies rely to offer new products and services capable of attracting consumer demand.
Garaizar, P. +2 more
core +1 more source
Advanced Functional Materials, EarlyView.Lead halide perovskite nanocrystals are promising scintillators but suffer from reabsorption losses and limited compatibility with high‐Z additives. Hybridization of CsPbBr3 nanocrystals with PbBr2‐passivated HfO2 nanoparticle sensitizers, achieved during or after synthesis, produces stable composites with maintained optical quality, improved ...
Francesco Bruni +17 more
wiley +1 more source
Computation, 2023 This paper presents a comprehensive approach for minimizing makespan in the challenging two-stage hybrid flowshop with dedicated machines, a problem known to be strongly NP-hard.
Mohamed Karim Hajji +2 more
doaj +1 more source
A heuristic solution to Fermat's last theorem
, 2023 For centuries, notable mathematicians spent time to prove or refute Fermat's last theorem. As a result, many mathematical proofs have been generated for different values of n. The English mathematician Andrew Wiles, after many attempts, and with the help of his former student Richard Taylor, finally came up with a proof of Fermat's last theorem, which ...
Sóstenes Rônmel Da Cruz +2 more
openaire +1 more source
Informed RRT*: Optimal sampling-based path planning focused via direct sampling of an admissible ellipsoidal heuristic [PDF]
2014 IEEE/RSJ International Conference on Intelligent Robots and Systems, 2014 Rapidly-exploring random trees (RRTs) are popular in motion planning because they find solutions efficiently to single-query problems. Optimal RRTs (RRT*s) extend RRTs to the problem of finding the optimal solution, but in doing so asymptotically find ...
J. Gammell, S. Srinivasa, T. Barfoot
semanticscholar +1 more source
Multipoint-to-multipoint network communication [PDF]
, 2009 We have formulated an exact ILP model for the problem of communicating on a virtual network. While this ILP model was successful in solving small problems, it is not recommended to handle larger instances, due to the fact that the number of variables in ...
Kilby, Philip +2 more
core