Results 291 to 300 of about 223,441 (320)
G-GANS for Adaptive Learning in Dynamic Network Slices
Meshari Huwaytim Alanazi
openalex +2 more sources
Estimate the volume of residual frozen coal in railway carriage using a rotating LiDAR. [PDF]
Sci RepMo XL +5 more
europepmc +1 more source
Enabling Sensor-Integrated and Sustainable Aerospace Structures Through Additively Manufactured Aluminium Mechanisms for CubeSats. [PDF]
Sensors (Basel)Alves B +7 more
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Families, Systems, & Health, 2019
This paper reformulates the problem of recommending related queries on a search engine as an extreme multi-label learning task. Extreme multi-label learning aims to annotate each data point with the most relevant subset of labels from an extremely large label set.
Himanshu Jain +3 more
openaire +2 more sources
This paper reformulates the problem of recommending related queries on a search engine as an extreme multi-label learning task. Extreme multi-label learning aims to annotate each data point with the most relevant subset of labels from an extremely large label set.
Himanshu Jain +3 more
openaire +2 more sources
Conditional slicing: Reducing dynamic slices
2015 IEEE International Symposium on Software Reliability Engineering Workshops (ISSREW), 2015This paper presents improvements on dynamic program slicing, a technique that is used in many fault localization approaches. In particular, we show how the number of source code statements in dynamic and relevant slices can be reduced further by focusing on the evaluation of conditional statements.
Birgit Hofer +2 more
openaire +1 more source
Building executable union slices using conditioned slicing
Proceedings. 12th IEEE International Workshop on Program Comprehension, 2004., 2004Program slicing can be used as a support for program comprehension, because it allows a large program to be divided up into smaller slices, each of which can be understood in isolation from the rest. As such, slicing facilitates the familiar approach of 'divide and conquer'.
S. DANICIC, DE LUCIA, Andrea, M. HARMAN
openaire +2 more sources
IEEE Transactions on Software Engineering, 1984
Program slicing is a method for automatically decomposing programs by analyzing their data flow and control flow. Starting from a subset of a program's behavior, slicing reduces that program to a minimal form which still produces that behavior. The reduced program, called a ''slice'', is an independent program guaranteed to represent faithfully the ...
openaire +2 more sources
Program slicing is a method for automatically decomposing programs by analyzing their data flow and control flow. Starting from a subset of a program's behavior, slicing reduces that program to a minimal form which still produces that behavior. The reduced program, called a ''slice'', is an independent program guaranteed to represent faithfully the ...
openaire +2 more sources
Proceedings of the 2014 Annual Conference on Extreme Science and Engineering Discovery Environment, 2014
High-end computing systems are becoming increasingly heterogeneous, with nodes comprised of multiple CPUs and accelerators, like GPGPUs, and with potential additional heterogeneity in memory configurations and network connectivities. Further, as we move to exascale systems, the view of their future use is one in which simulations co-run with online ...
Alexander Merritt +5 more
openaire +1 more source
High-end computing systems are becoming increasingly heterogeneous, with nodes comprised of multiple CPUs and accelerators, like GPGPUs, and with potential additional heterogeneity in memory configurations and network connectivities. Further, as we move to exascale systems, the view of their future use is one in which simulations co-run with online ...
Alexander Merritt +5 more
openaire +1 more source