Results 141 to 150 of about 73,753 (309)
A polynomial-time algorithm for knapsack with divisible item sizes
, 1997 We consider the special case of the bounded knapsack problem with divisible item sizes, and present an algorithm that solves it in polynomial time. The main characteristic of the algorithm is the fact that it handles the items in order of increasing size,
Aarts, E.H.L., Verhaegh, W.F.J.
core +1 more source
Data‐Guided Photocatalysis: Supervised Machine Learning in Water Splitting and CO2 Conversion
Advanced Intelligent Discovery, EarlyView.This review highlights recent advances in supervised machine learning (ML) for photocatalysis, emphasizing methods to optimize photocatalyst properties and design materials for solar‐driven water splitting and CO2 reduction. Key applications, challenges, and future directions are discussed, offering a practical framework for integrating ML into the ...
Paul Rossener Regonia +1 more
wiley +1 more source
A dynamic lot-sizing model with demand time windows
One of the basic assumptions of the classical dynamic lot-sizing model is that the aggregate demand of a given period must be satisfied in that period.
Lee, C.Y. +2 more
core
An Algorithm for Distributing Coalitional Value Calculations among Cooperating Agents
, 2007 The process of forming coalitions of software agents generally requires calculating a value for every possible coalition which indicates how beneficial that coalition would be if it was formed.
Jennings, N. R. +5 more
core +1 more source
Data‐Driven High‐Throughput Volume Fraction Estimation From X‐Ray Diffraction Patterns
Advanced Intelligent Discovery, EarlyView.Long exposure times and the need for manual evaluation limit the use of X‐ray diffraction in high‐throughput applications. This study presents a data‐driven approach addressing both issues. HiVE (a method for High‐throughput Volume fraction Estimation) performs composition estimation for high‐noise XRD patterns produced using polychromatic emission ...
Hawo H. Höfer +6 more
wiley +1 more source
A polynomial time algorithm for computing the area under a GDT curve. [PDF]
Algorithms Mol Biol, 2015 Poleksic A.
europepmc +1 more source
A Unifying Approach to Self‐Organizing Systems Interacting via Conservation Laws
Advanced Intelligent Discovery, EarlyView.The article develops a unified way to model and analyze self‐organizing systems whose interactions are constrained by conservation laws. It represents physical/biological/engineered networks as graphs and builds projection operators (from incidence/cycle structure) that enforce those constraints and decompose network variables into constrained versus ...
F. Barrows +7 more
wiley +1 more source
New Tools for Tuning PID Controllers Using Orthogonal Polynomials
IEEE AccessThis paper presents an algorithm to determine PID controller tuning regions that guarantee the stability of closed-loop control systems using the pole placement method, assigning a known robustly stable polynomial that depends on a vector of uncertain ...
Alejandro Arceo +3 more
doaj +1 more source
A Polynomial Time Algorithm for SAT
CoRR, 2007 Article presents the compatibility matrix method and illustrates it with the application to P vs NP problem. The method is a generalization of descriptive geometry: in the method, we draft problems and solve them utilizing the image creation technique.
openaire +2 more sources
An Accept-and-Reject Algorithm to Sample from a Set of Permutations Restricted by a Time Constraint
A modification of an accept-and-reject algorithm to sample from a set of restricted permutations is proposed. By concentrating on a special class of matrices obtained by restriction of the permutation in time, assuming the objects to be permuted to be ...
Johannes Hüsing
core