Results 131 to 140 of about 8,140,957 (328)

On the robust assignment problem under a fixed number of cost scenarios

, 2006
We investigate the complexity of the min-max assignment problem under a fixed number of scenarios. We prove that this problem is polynomial-time equivalent to the exact perfect matching problem in bipartite graphs.
Deineko, VG, Woeginger, G.J., Deineko, Vladimir G., Deineko, V.G., Woeginger, GJ Gerhard, Woeginger, Gerhard J.   +5 more
core   +1 more source

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

Advanced 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, Abril Azocar Guzman, Sarath Menon, Stefan Sandfeld, Tilmann Hickel, Markus Stricker   +5 more
wiley   +1 more source

Microstructure Reconstruction in Battery Electrodes Using Machine Learning Based on Low‐Voltage Focused Ion Beam–Scanning Electron Microscopy Tomography Images

Advanced Engineering Materials, EarlyView.
Low‐voltage FIB‐SEM tomography combined with a image preprocessing pipeline improves phase contrast and enables reliable machine‐learning segmentation of conductive networks in lithium‐ion battery electrodes. Structural descriptors are extracted from segmented images, done semimanually and automated, and compared.
Lisa Beran, Vincent Nebel, Dominik Perius, Kshitij Kumar, Yannis Heim, Laura Bies, Tobias Kraus   +6 more
wiley   +1 more source

An Agent Based Market Design Methodology for Combinatorial Auctions [PDF]

Auction mechanisms have attracted a great deal of interest and have been used in diverse e-marketplaces. In particular, combinatorial auctions have the potential to play an important role in electronic transactions.
Kun Chang Lee, Gyoo Gun Lim, Jinho Choi
core  

A combinatorial optimization problem arising from text classification

, 2003
We study a combinatorial optimization problem related to the automatic classification of texts. The problem consists of covering a given text using strings from a given set, where a cost is incurred for each type of string used.
S. Bosio, G. Righini
core   +1 more source

Influence of Scan Strategies in Electron Beam Powder Bed Fusion on Solidification, Microstructure, and High‐Temperature Compressive Properties of γ′‐Strengthened Inconel 738LC

Advanced Engineering Materials, EarlyView.
Experiments and thermophysical simulations were conducted to investigate the electron beam powder bed fusion electron beam (PBF‐EB/M) process for the γ′‐strengthened nickel‐based superalloy Inconel 738LC. The results demonstrate the impact of process‐induced microstructural variations on high‐temperature mechanical behavior, providing a basis for ...
Jan Niklas Petenati, Karthik Kumar Banku, Prasanth Bondi, Ivan Zhirnov, Yangyiwei Yang, Gordon Schmidt, Jürgen Christen, Georg Hasemann, Manja Krüger, Bai‐Xiang Xu, Bilal Gökce, Silja‐Katharina Rittinghaus   +11 more
wiley   +1 more source

Making Robust Decisions in Discrete Optimization Problems as a Game against Nature [PDF]

In this paper a discrete optimization problem under uncertainty is discussed. Solving such a problem can be seen as a game against nature. In order to choose a solution, the minmax and minmax regret criteria can be applied.
Adam Kasperski
core  

A fast approximation algorithm for solving the complete set packing problem

, 2014
We study the complete set packing problem (CSPP) where the family of feasible subsets may include all possible combinations of objects. This setting arises in applications such as combinatorial auctions (for selecting optimal bids) and cooperative game ...
Nguyen, Tri-Dung
core   +1 more source

A general ant colony model to solve combinatorial optimization problems

Revista Colombiana de Computación, 2001
An Ants System is an artificial system based on the behavior of real ant colonies, which is used to solve combinatorial problems. Keywords: Combinatorial Optimization Problem,AntSystem, the Graph Partitioning and The Traveling Salesman Problems.
José Aguilar
doaj  

New AI‐Assisted Approach for Expanding the Solution Space: Application to Lattice Structure Design

Advanced Engineering Materials, EarlyView.
This work introduces an innovative framework for designing structured materials by ex panding the design space through reparameterization of qualitative variables into continuous structural descriptors. Combined with machine‐learning‐based prediction and multi‐objective optimization, the approach enables the discovery of novel lattice architectures ...
G. H. Gahimbare, Y. Beideler, D. Chune, R. De Guio, T. Roland, H. Chibane   +5 more
wiley   +1 more source