Search Results - Computing methodologies Artificial intelligence Search methodologies

LEGION: Best-First Concolic Testing by Liu, Dongge, Ernst, Gidon, Murray, Toby, Rubinstein, Benjamin I.P.

“… Legion re-engineers the Monte Carlo tree search (MCTS) framework from the AI literature to treat automated test generation as a problem of sequential decision-making under uncertainty…”
Get full text

Adaptive bug isolation by Arumuga Nainar, Piramanayagam, Liblit, Ben

“… We formulate this approach as a search on the control-dependence graph of the program. We present and evaluate various heuristics that can be used for this search…”
Get full text

Neuromorphic Monte Carlo Tree Search Methods for Shortest Path Interdiction by Ho, Yang, Carbajal, Armida, Escamilla, Leonardo, Pinar, Ali

“…Monte Carlo tree search (MCTS) is a commonly used heuristic algorithm to explore extremely large search spaces for decision making in general and for tackling Stackelberg games in particular…”
Get full text

GENESYS: A novel evolutionary program synthesis tool with continuous optimization by Mandal, Shantanu, Anderson, Todd A, Turek, Javier, Gottschlich, Justin, Muzahid, Abdullah

“… Most existing approaches formulate program synthesis as a search problem with discrete parameters…”
Get full text

SAPO: Improving the Scalability and Accuracy of Quantum Linear Solver for Portfolio Optimization by Zhu, Tianze, Lu, Liqiang, Chen, Jiajun, Chen, Yuhang, Chen, Hengrui, Xi, Meng, Zhang, Jinshan, Sun, Xiaoming, Yin, Jianwei

“… Quantum computing offers polynomial or even exponential speedup that turns out to be a promising approach…”
Get full text

Enhancing Genetic Improvement of Software with Regression Test Selection by Guizzo, Giovani, Petke, Justyna, Sarro, Federica, Harman, Mark

“…Genetic improvement uses artificial intelligence to automatically improve software with respect to non-functional properties (AI for SE…”
Get full text

Accelerating Decision-Tree-Based Inference Through Adaptive Parallelization by Van Lunteren, Jan

“… They are applied to a broad spectrum of applications as diverse as search engine ranking, credit card fraud detection, customer relationship management, fault diagnosis in machinery, and geological…”
Get full text

GAssert: A Fully Automated Tool to Improve Assertion Oracles by Terragni, Valerio, Jahangirova, Gunel, Tonella, Paolo, Pezze, Mauro

“…This demo presents the implementation and usage details of GASSERT, the first tool to automatically improve assertion oracles. Assertion oracles are executable…”
Get full text

Instruction Scheduling for the GPU on the GPU by Shobaki, Ghassan, Muyan-Ozcelik, Pinar, Hutton, Josh, Linck, Bruce, Malyshenko, Vladislav, Kerbow, Austin, Ramirez-Ortega, Ronaldo, Gordon, Vahl Scott

“…). ACO is a nature-inspired intelligent-search technique that has been used to compute precise solutions to NP-hard problems in operations research…”
Get full text

FastCA: An Effective and Efficient Tool for Combinatorial Covering Array Generation by Lin, Jinkun, Cai, Shaowei, He, Bing, Fu, Yingjie, Luo, Chuan, Lin, Qingwei

“…Combinatorial interaction testing (CIT) is a popular approach to detecting faults in highly configurable software systems. The core task of CIT is to generate…”
Get full text

Search-Based Test Generation for Android Apps by Moreno, Ivan Arcuschin

“… In particular, I plan to investigate which is the best search-based algorithm for this particular problem…”
Get full text

An Evolutionary Framework for Analyzing the Distance Preserving Property of Weighted Graphs by Zahedi, Emad, Mirmomeni, Masoud, Esfahanian, Abdol-Hossein

“… Here, we propose a biologically-inspired search algorithm to address the problem of finding isometric subgraphs that consequently determines if a given graph is distance preserving…”
Get full text

A Tree Based Router Search Engine Architecture with Single Port Memories by Baboescu, Florin, Tullsen, Dean M., Rosu, Grigore, Singh, Sumeet

“…Pipelined forwarding engines are used in core routers to meet speed demands. Tree-based searches are pipelined across a number of stages to achieve high throughput, but this results in unevenly distributed memory…”
Get full text

CompilerGym: Robust, Performant Compiler Optimization Environments for AI Research by Cummins, Chris, Wasti, Bram, Guo, Jiadong, Cui, Brandon, Ansel, Jason, Gomez, Sahir, Jain, Somya, Liu, Jia, Teytaud, Olivier, Steiner, Benoit, Tian, Yuandong, Leather, Hugh

“…Interest in applying Artificial Intelligence (AI) techniques to compiler optimizations is increasing rapidly, but compiler research has a high entry barrier…”
Get full text

A practical guide for using statistical tests to assess randomized algorithms in software engineering by Arcuri, Andrea, Briand, Lionel

“…Randomized algorithms have been used to successfully address many different types of software engineering problems. This type of algorithms employ a degree of…”
Get full text

Leveraging Hybrid Classical-Quantum Methods for Efficient Load Rebalancing in HPC by Zawalska, Justyna, Chung, Minh, Rycerz, Katarzyna, Schulz, Laura, Schulz, Martin, Kranzlmuller, Dieter

“…Load imbalance is a challenge for parallel applications in High Performance Computing (HPC…”
Get full text

Evolutionary Computation and Reinforcement Learning for Cyber-physical System Design by Lu, Chengjie

“…Cyber-physical systems (CPSs) are designed to in-tegrate computation and physical processes through constantly interacting with the physical environment. The…”
Get full text

Beyond the Yield Barrier: Variational Importance Sampling Yield Analysis by Liu, Yanfang, He, Lei, Xing, Wei W.

“…Optimal mean shift vector (OMSV)-based importance sampling methods have long been prevalent in yield estimation and optimization as an industry standard…”
Get full text

A Scalable Distributed Parallel Breadth-First Search Algorithm on BlueGene/L by Yoo, Andy, Chow, Edmond, Henderson, Keith, McLendon, William, Hendrickson, Bruce, Catalyurek, Umit

“… This paper presents a distributed breadth- first search (BFS) scheme that scales for random graphs with up to three billion vertices and 30 billion edges…”
Get full text

Optimizing Tensor Computation Graphs with Equality Saturation and Monte Carlo Tree Search by Hartmann, Jakob, He, Guoliang, Yoneki, Eiko

“…The real-world effectiveness of deep neural networks often depends on their latency, thereby necessitating optimization techniques that can reduce a model's…”
Get full text