Results 161 to 170 of about 321 (213)
Surrogate‐Optimized Flow‐Guided Miniature Condenser for Rapid Exhaled Glucose Detection
Advanced Materials Technologies, EarlyView.A surrogate‐optimized miniature condenser guides humid exhaled flow toward cold surfaces to accelerate exhaled breath condensate collection. By improving vapor access within a compact footprint, the design increases sample yield. This enables post‐collection enrichment and rapid colorimetric glucose detection from dilute exhaled biomarkers within a 5 ...
Yiming Thomas Lu +6 more
wiley +1 more source
On‐Chip Photonic Neural Network Architectures
Advanced Optical Materials, EarlyView.This review presents a comprehensive overview of on‐chip photonic neural network architectures, covering key photonic building blocks, representative network types, and emerging applications. Recent advances, implementation challenges, and future directions are examined, highlighting the potential of integrated photonics to enable ultrafast, energy ...
Seokjin Hong +7 more
wiley +1 more source
Advanced Optical Materials, EarlyView.1D and 3D nanoporous anodic aluminum oxide (AAO) surfaces were functionalized with stearic acid (STA) to increase hydrophobicity and reduce the influence of humidity on radiative cooling performance. The STA coating improves cooling behavior under humid atmospheric conditions (Madrid summer), before while keeping the optical properties required for ...
Luis Moreno‐Sanabria +4 more
wiley +1 more source
Advanced Optical Materials, EarlyView.Tailored amine substitution in fluorene and dibenzothiophene derivatives enables systematic control of excited‐state properties and triplet population. Combined photophysical studies, TD‐DFT calculations and time‐resolved EPR reveal how charge‐transfer character, sulfur‐induced spin–orbit coupling and triplet manifold engineering cooperate to promote ...
Francesco Ruighi +10 more
wiley +1 more source
Scalable Task Planning via Large Language Models and Structured World Representations
Advanced Robotics Research, EarlyView.This work efficiently combines graph‐based world representations with the commonsense knowledge in Large Language Models to enhance planning techniques for the large‐scale environments that modern robots will need to face. Planning methods often struggle with computational intractability when solving task‐level problems in large‐scale environments ...
Rodrigo Pérez‐Dattari +4 more
wiley +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Fuzzy Sets and Systems, 2001
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kim, JK +2 more
exaly +3 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kim, JK +2 more
exaly +3 more sources
Algorithms for the Bin Packing Problem with Conflicts
INFORMS Journal on Computing, 2010We consider a particular bin packing problem in which some pairs of items may be in conflict and cannot be assigned to the same bin. The problem, denoted as the bin packing problem with conflicts, is of practical and theoretical interest because of its many real-world applications and because it generalizes both the bin packing problem and the vertex ...
Paolo Tóth +2 more
exaly +2 more sources
THE GRAPH-BIN PACKING PROBLEM [PDF]
International Journal of Foundations of Computer Science, 2011 We deal with a very general problem: a given graph G is to be "packed" into a host graph H, and we are asked about some natural optimization questions concerning this packing. The problem has never been investigated before in this general form. The input of the problem is a simple graph G = (V, E) with lower and upper bounds on its edges and weights ...
Csilla Bujtás +4 more
openaire +3 more sources
Bin packing problem with scenarios [PDF]
Central European Journal of Operations Research, 2018 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Attila Bódis, János Balogh
openaire +3 more sources
On a generalized bin‐packing problem
Naval Research Logistics Quarterly, 1982AbstractIn this paper we address a bin‐packing problem which possesses a variety of modifications of the classic theme. Among these are bin‐dependent chip weights, bin costs, and bin‐dependent penalties for unused capacity. Lagrangian relaxations are employed in the context of a branch‐and‐bound framework in order to solve the problem after which ...
Lewis, R. T., Parker, R. G.
openaire +1 more source