Results 51 to 60 of about 35,838 (299)

Is an Apple an Orange? A Large Language Model Benchmark for Candidate Term Extraction and Subclass Decisions Against Upper Ontologies in Engineering and Materials Science

open access: yesAdvanced Engineering Materials, EarlyView.
Building machine‐readable vocabularies for materials science is slow, expert‐driven work. This study benchmarks 13 large language models on two of its first steps: finding candidate terms in engineering articles and deciding where they belong in a class hierarchy.
Thomas Bjarsch   +3 more
wiley   +1 more source

Branch-and-Bound and Heuristic Algorithms for Group Scheduling with Due-Date Assignment and Resource Allocation

open access: yesMathematics, 2023
Green scheduling that aims to enhance efficiency by optimizing resource allocation and job sequencing concurrently has gained growing academic attention.
Hongyu He   +4 more
doaj   +1 more source

A-optimality orthogonal forward regression algorithm using branch and bound

open access: yes, 2008
In this brief, we propose an orthogonal forward regression (OFR) algorithm based on the principles of the branch and bound (BB) and A-optimality experimental design.
Harris, C. J.   +5 more
core   +1 more source

Optimization of the Production of Rubber Compounds Using Mathematical Models

open access: yesAdvanced Engineering Materials, EarlyView.
Rubber compounds were mixed in a batch internal mixer, and symbolic regression was used to derive mathematical models linking recipe and process parameters to ram path, torque, and mixing quality (incorporation, dispersion, distribution). Subsequent optimization with evolutionary algorithms identified operating conditions that reduce specific energy ...
Anke Bardehle   +7 more
wiley   +1 more source

Developing a Branch and Bound Algorithm for Cell Formation and Group Scheduling [PDF]

open access: yesEngineering and Technology Journal, 2018
Scheduling models for groups of parts have become more widely used in the industrial companies because of intensification of competition among them to get optimization in the delivery orders, reduce costs and increase quality. “Production scheduling is a
Amjad Abdulghafour, Dhulfiqar Dhayef
doaj   +1 more source

An Ellipsoidal Branch and Bound Algorithm for Global Optimization

open access: yesSIAM Journal on Optimization, 2009
19 ...
William W. Hager, Dzung T. Phan
openaire   +3 more sources

Ontology‐Aligned Structuring and Reuse of Multimodal Materials Data and Workflows Toward Automatic Reproduction

open access: yesAdvanced Engineering Materials, EarlyView.
Reproduction of stacking fault energy calculations from literature with a semi‐automated large language model‐assisted extraction procedure: extraction of simulation protocol, atomistic structures, computational parameters, and reported results, ontology alignment, knowledge graph construction and, finally, recomputation forvalidation.
Sepideh Baghaee Ravari   +5 more
wiley   +1 more source

Branch And Bound Algorithm Analysis For Solving Job Assignment Problems

open access: yes, 2021
The Branch & Bound algorithm is a method commonly used to solve optimization problems. Some examples of problems that the Branch & Bound algorithm can solve are Knapsack Problems, Traveling Salesman Problems, Scheduling Problems and many other ...
et. al., Sriyani Violina,
core   +1 more source

A Practical Noise2Noise Denoising Pipeline for High‐Throughput Raman Spectroscopy

open access: yesAdvanced Engineering Materials, EarlyView.
A lightweight and reproducible denoising pipeline for high‐throughput Raman spectroscopy is introduced, based on a 1D convolutional autoencoder trained with a Noise2Noise strategy. Using only repeated short‐exposure acquisitions, the method suppresses stochastic noise without reference spectra, enabling reliable spectral reconstruction while preserving
David Martin‐Calle   +5 more
wiley   +1 more source

A Branch-And-Bound Algorithm for Cluster Editing.

open access: yes, 2022
The cluster editing problem asks to transform a given graph into a disjoint union of cliques by inserting and deleting as few edges as possible. We describe and evaluate an exact branch-and-bound algorithm for cluster editing. For this, we introduce new reduction rules and adapt existing ones. Moreover, we generalize a known packing technique to obtain
Thomas Bläsius   +7 more
openaire   +3 more sources

Home - About - Disclaimer - Privacy