Results 121 to 130 of about 82,329 (274)
Abstract Under time‐varying electricity prices, the production costs of Power‐to‐X processes with intermediate storage can be reduced by simultaneously optimizing the process unit design and size with their scheduling and operation. However, the production cost sensitivity to optimal process design or scheduling is unclear, especially when several ...
Simone Mucci, Dominik Bongartz
wiley +1 more source
Integer Factorization: Another perspective
Integer factorization is a fundamental problem in algorithmic number theory and computer science. It is considered as a one way or trapdoor function in the (RSA) cryptosystem. To date, from elementary trial division to sophisticated methods like the General Number Field Sieve, no known algorithm can break the problem in polynomial time, while its ...
Bansimba, Gilda Rech +1 more
openaire +2 more sources
Graph‐based imitation and reinforcement learning for efficient Benders decomposition
Abstract This work introduces an end‐to‐end graph‐based agent for accelerating the computational efficiency of Benders Decomposition. The agent's policy is parameterized by a graph neural network, which takes as input a bipartite graph representation of the master problem and proposes a candidate solution.
Bernard T. Agyeman +3 more
wiley +1 more source
Integer factorization algorithms
The decomposition of a natural number into a product of prime numbers is called factorization. The main problem with factorization is the fact that there is no known efficient algorithm which would factor a given natural number n in polynomial time. The closest equivalent to such an algorithm is Shor's algorithm for quantum computers, which is still ...
openaire +1 more source
Domain‐Aware Implicit Network for Arbitrary‐Scale Remote Sensing Image Super‐Resolution
Although existing arbitrary‐scale image super‐resolution methods are flexible to reconstruct images with arbitrary scales, the characteristic of training distribution is neglected that there exists domain shift between samples of various scales. In this work, a Domain‐Aware Implicit Network (DAIN) is proposed to handle it from the perspective of domain
Xiaoxuan Ren +6 more
wiley +1 more source
Solving continuous variable optimization problems by factorization machine quantum annealing (FMQA) demonstrates the potential of Ising machines to be extended as a solver for integer and real optimization problems.
Katsuhiro Endo, Kazuaki Z. Takahashi
doaj +1 more source
Four Integer Factorization Algorithms
Improvements in Theorem 14, 12 ...
openaire +2 more sources
Machine learning predicts activation energies for key steps in the water‐gas shift reaction on 92 MXenes. Random Forest is identified as the most accurate model. Reaction energy and reactant LogP emerge as key descriptors. The approach provides a predictive framework for catalyst design, grounded in density functional theory data and validated through ...
Kais Iben Nassar +3 more
wiley +1 more source
The authors evaluated six machine‐learned interatomic potentials for simulating threshold displacement energies and tritium diffusion in LiAlO2 essential for tritium production. Trained on the same density functional theory data and benchmarked against traditional models for accuracy, stability, displacement energies, and cost, Moment Tensor Potential ...
Ankit Roy +8 more
wiley +1 more source
Solving Data Overlapping Problem Using A Class‐Separable Extreme Learning Machine Auto‐Encoder
The overlapping and imbalanced data in classification present key challenges. Class‐separable extreme learning machine auto‐encoding (CS‐ELM‐AE) is proposed, which is an enhancement of ELM‐AE that better handles overlapping data by clustering points from the same class together. Applying oversampling addresses imbalanced data.
Ekkarat Boonchieng, Wanchaloem Nadda
wiley +1 more source

