Results 141 to 150 of about 65,434 (314)
Factorization machine with iterative quantum reverse annealing (FMIRA) leverages quantum reverse annealing to perform batch black‐box optimization. Factorization machine with quantum annealing (FMQA) is a widely used python package for solving black‐box optimization problems using D‐Wave quantum annealers.
Andrejs Tučs, Ryo Tamura, Koji Tsuda
wiley +1 more source
Adaptive approach heuristics for the generalized assignment problem [PDF]
The Generalized Assignment Problem consists in assigning a set of tasks to a set of agents with minimum cost. Each agent has a limited amount of a single resource and each task must be assigned to one and only one agent, requiring a certain amount of the
Helena Ramalhinho-Lourenço +1 more
core
An Autonomous Large Language Model‐Agent Framework for Transparent and Local Time Series Forecasting
Architecture of the proposed large language model (LLM)‐based agent framework for autonomous time series forecasting in thermal power generation systems. The framework operates through a vertical pipeline initiated by natural language queries from users, which are processed by the LLM Agent Core powered by Llama.cpp and a ReAct loop with persistent ...
William Gouvêa Buratto +5 more
wiley +1 more source
A Novel Pareto-Based Meta-Heuristic Algorithm To Optimize Multi-Facility Location-Allocation Problem
Vahid Hajipour +2 more
openalex +2 more sources
Autonomous AI‐Driven Design for Skin Product Formulations
This review presents a comprehensive closed‐loop framework for autonomous skin product formulation design. By integrating artificial intelligence‐driven experiment selection with automated multi‐tiered assays, the approach shifts development from trial‐and‐error to intelligent optimisation.
Yu Zhang +5 more
wiley +1 more source
A Comparative Study of Machine Learning Heuristic Algorithms to Solve the Traveling Salesman Problem
Volkan Uslan, İhsan Ömür Bucak
openalex +1 more source
Special Issue on Exact and Heuristic Scheduling Algorithms [PDF]
Frank Werner +2 more
openalex +1 more source
Heuristic estimates in shortest path algorithms
Shortest path problems occupy an important position in Operations Research aswell as in Arti¯cial Intelligence. In this paper we study shortest path algorithms thatexploit heuristic estimates. The well-known algorithms are put into one framework.Besides
Pijls, W.H.L.M.
core
Maximum simulated likelihood estimation (MSLE) is inherently complex due to the presence of multiple local maxima, which hinder standard optimization methods.
Haering, Tom, Bierlaire, Michel
core +1 more source
A Heuristic algorithm for fixed train runtime
This paper proposes a train movement model\ud with fixed runtime that can be employed to find\ud feasible control strategies for a single train along\ud an inter-city railway line.
Mao, B.H. +9 more
core +1 more source

