Results 91 to 100 of about 332,730 (283)
Interactive Heuristic Search Algorithm [PDF]
, 2002 We present a hybrid heuristic search algorithm for constraint satisfaction problems, which was proposed as a mixture of two basic approaches: local search and backtrack based search. One of its major advantages is interactive behaviour in the sense of changing the task during the search. Some results are presented using the well known n-queens problem.
openaire +1 more source
COGENT programming manual [PDF]
, 1969 COGENT /COmpiler and GENeralized Translator/ programming system is a compiler whose input language enables a description of symbolic and linguistic manipulation algorithms.
Reynolds, J. C.
core +1 more source
Advanced Science, EarlyView.AP‐Lab bridges materials discovery and industrial manufacturing by coupling proprietary datasets with an application benchmark (PCR Ct). A closed‐loop optimization workflow integrates ML, LLM, and autonomous synthesis/testing to refine magnetic nanoparticles–based nucleic‐acid extraction systems.
Zhan‐Long Wang +12 more
wiley +1 more source
The cartography of computational search spaces [PDF]
, 2018 This talk will present our recent findings and visual (static and animated) maps characterising combinatorial and computer program search spaces. We seek to lay the foundations for a new perspective to understand problem structure and improve heuristic ...
Ochoa, Gabriela
core
Advanced Electronic Materials, EarlyView.Ising machines are emerging as specialized hardware solvers for computationally hard optimization problems. This review examines five major platforms—digital CMOS, analog CMOS, emerging devices, coherent optics, and quantum systems—highlighting physics‐rooted advantages and shared bottlenecks in scalability and connectivity.
Hyunjun Lee, Joon Pyo Kim, Sanghyeon Kim
wiley +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
A multiscale Bayesian optimization framework for process and material codesign
AIChE Journal, EarlyView.Abstract The simultaneous design of processes and enabling materials such as solvents, catalysts, and adsorbents is challenging because molecular‐ and process‐level decisions are strongly interdependent. Sequential approaches often yield suboptimal results since improvements in material properties may not translate into superior process performance. We
Michael Baldea
wiley +1 more source
Heuristic Clustering Algorithms in Ad hoc Networks
Emerging Markets Journal, 2014 The clustering allows dividing the geographical region to be covered into small zones in which each zone can be handled with a powerful node called clusterhead.
Nevin Aydın
doaj +1 more source
Trust‐region filter algorithms utilizing Hessian information for gray‐box optimization
AIChE Journal, EarlyView.Abstract Optimizing industrial processes often involves gray‐box models that couple algebraic glass‐box equations with black‐box components lacking analytic derivatives. Such systems challenge derivative‐based solvers. The classical trust‐region filter (TRF) algorithm provides a robust framework but requires extensive parameter tuning and numerous ...
Gul Hameed +4 more
wiley +1 more source
A trust‐region funnel algorithm for gray‐box optimization
AIChE Journal, EarlyView.Abstract Gray‐box optimization, where parts of optimization problems are represented by algebraic models while others are treated as black‐box models lacking analytic derivatives, remains a challenge. Trust‐region (TR) methods provide a robust framework for gray‐box problems through local reduced models (RMs) for black‐box components, but they are ...
Gul Hameed +4 more
wiley +1 more source