Abstract: The recovery of contextual meanings on a machine code is required by a wide range of binary analysis applications, such as bug discovery, malware analysis, and code clone detection. To ...
Abstract: Combinatorial optimization problems (COPs) are NP-hard, and their solution space is discrete, which poses a significant challenge for optimization algorithms. Binary Particle Swarm ...
Java and C++ implementations of a dynamic, self-balancing k-d tree and a k-d tree-based key-to-multiple-value map, and multi-threaded implementations of a static k-d tree and a k-d tree-based ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback