Results 131 to 140 of about 45,458 (300)
Supporting Feature Analysis with Runtime Annotations [PDF]
, 2007 The dynamic analysis approach to feature identification describes a technique for capturing feature behavior and mapping it to source code. Major drawbacks of this approach are (1) large amounts of data and (2) lack of support for sub-method elements. In
Marcus Denker +5 more
core
Advanced Intelligent Discovery, EarlyView.In this study we employed support vector regressor and quantum support vector regressor to predict the hydrogen storage capacity of metal–organic frameworks using structural and physicochemical descriptors. This study presents a comparative analysis of classical support vector regression (SVR) and quantum support vector regression (QSVR) in predicting ...
Chandra Chowdhury
wiley +1 more source
Advanced Intelligent Discovery, EarlyView.Several simulation techniques are used to explore static and dynamic behavior in polyanion sodium cathode materials. The study reveals that universal machine learning interatomic potentials (MLIPs) struggle with system‐specific chemistry, emphasizing the need for tailored datasets.
Martin Hoffmann Petersen +5 more
wiley +1 more source
Hunting for quantum-classical crossover in condensed matter problems
npj Quantum InformationThe intensive pursuit for quantum advantage in terms of computational complexity has further led to a modernized crucial question of when and how will quantum computers outperform classical computers.
Nobuyuki Yoshioka +4 more
doaj +1 more source
CacheAware: Data Locality-Aware Scheduling for Distributed Memory Systems
ComputersThe widening performance gap between processor speed and memory access latency has made data locality a critical bottleneck in high-performance computing. In Non-Uniform Memory Access (NUMA) and distributed memory systems, remote accesses incur penalties
Haifa A. Alanazi +2 more
doaj +1 more source
Data-Driven Runtime Complexity Analysis
Abstract We establish a data-driven method for the assessment of the runtime complexity of first-order term rewrite systems (TRSs for short). The fully automated complexity analysis of TRSs has a long tradition in rewriting and numerous sophisticated static analysis methods have been developed. The recent success in machine learning motivates
Samuel Frontull +2 more
openaire +1 more source
Model Based Development of Quality-Aware Software Services
, 2008 Modelling languages and development frameworks give support for functional and structural description of software architectures. But quality-aware applications require languages which allow expressing QoS as a first-class concept during architecture ...
Philippe Massonet +7 more
core +1 more source
Advanced Intelligent Discovery, EarlyView.Capacitive, charge‐domain compute‐in‐memory (CIM) stores weights as capacitance,eliminating DC sneak paths and IR‐drop, yielding near‐zero standbypower. In this perspective, we present a device to systems level performance analysis of most promising architectures and predict apathway for upscaling capacitive CIM for sustainable edge computing ...
Kapil Bhardwaj +2 more
wiley +1 more source
Advanced Intelligent Discovery, EarlyView.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
LLM‐Based Scientific Assistants for Knowledge Extraction: Which Design Choices Matter?
Advanced Intelligent Discovery, EarlyView.A comprehensive framework for optimizing Large Language Models in domain‐specific applications is introduced. The LLM Playground integrates Prompt Engineering, knowledge augmentation, and advanced reasoning strategies to enable systematic comparison of architectures and base models.
David Exler +7 more
wiley +1 more source