Results 141 to 150 of about 65,434 (314)

Factorization Machine with Iterative Quantum Reverse Annealing: A Python Package for Batch Black‐Box Optimization With Reverse Quantum Annealing

open access: yesAdvanced Intelligent Discovery, EarlyView.
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]

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

open access: yesAdvanced Intelligent Discovery, EarlyView.
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

Autonomous AI‐Driven Design for Skin Product Formulations

open access: yesAdvanced Intelligent Discovery, EarlyView.
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

Heuristic estimates in shortest path algorithms

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

BHAMSLE: A Breakpoint Heuristic Algorithm for Maximum Simulated Likelihood Estimation of Advanced Discrete Choice Models

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

open access: yes, 2008
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

Home - About - Disclaimer - Privacy