Search Results - Computing methodologies Artificial intelligence Search methodologies Discrete space research

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

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

“… How to achieve the best of both remains an open challenge. To address this research problem, we propose and evaluate Legion…”
Get full text

Code Difference Guided Adversarial Example Generation for Deep Code Models by Tian, Zhao, Chen, Junjie, Jin, Zhi

“… Moreover, the adversarial example generation techniques specific to deep code models still suffer from unsatisfactory effectiveness due to the enormous ingredient search space…”
Get full text

PertNAS: Architectural Perturbations for Memory-Efficient Neural Architecture Search by Ahmad, Afzal, Xie, Zhiyao, Zhang, Wei

“… In this way, it extracts high-quality motifs from the search space. We utilize these perturbations to perform NAS in compact models evolving over time to traverse the search space…”
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

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

Graph Representation Learning for Microarchitecture Design Space Exploration by Yi, Xiaoling, Lu, Jialin, Xiong, Xiankui, Xu, Dong, Shang, Li, Yang, Fan

“…Design optimization of modern microprocessors is a complex task due to the exponential growth of the design space…”
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

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 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

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

An improved thermodynamic simulated annealing-based approach for resource-skewness-aware and power-efficient virtual machine consolidation in cloud datacenters by Saeedi, Pedram, Hosseini Shirvani, Mirsaeid

“…Cloud computing attracted great attention in both industry and research communities for the sake of its ubiquitous, elasticity and economic services…”
Get full text

Quantum Circuit Compilers Using Gate Commutation Rules by Itoko, Toshinari, Raymond, Rudy, Imamichi, Takashi, Matsuo, Atsushi, Cross, Andrew W.

“…The use of noisy intermediate-scale quantum computers (NISQCs), which consist of dozens of noisy qubits with limited coupling constraints, has been increasing…”
Get full text

Efficient DWT-based fusion techniques using genetic algorithm for optimal parameter estimation by Kavitha, S., Thyagharajan, K. K.

“… In this research work, discrete wavelet transform (DWT) and undecimated discrete wavelet transform (UDWT…”
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

Faster Greedy Optimization of Resistance-based Graph Robustness by Predari, Maria, Kooij, Robert, Meyerhenke, Henning

“… The pseudoinverse may be computed explicitly via pseudoinversion; yet, this takes cubic time in practice and quadratic space…”
Get full text

DiffSAT: Differential MaxSAT Layer for SAT Solving by Zhang, Yu, Zhen, Hui-Ling, Yuan, Mingxuan, Yu, Bei

“…) framework to efficiently search the solution space and resolve conflicts during the search process…”
Get full text

Improved arithmetic optimization algorithm for patient admission scheduling problem by Alawad, Noor Aldeen, Abed-alguni, Bilal H., Saleh, Israa I.

“… it. The arithmetic optimization algorithm (AOA) is a new optimization algorithm that can effectively solve both continuous and discrete optimization problems…”
Get full text

Iterated local search using an add and delete hyper-heuristic for university course timetabling by Soria-Alcaraz, Jorge A., Özcan, Ender, Swan, Jerry, Kendall, Graham, Carpio, Martin

“…).•An effective hyper-heuristic approach operating with ADLs is proposed.•Low level heuristics perform search over the space of feasible solutions…”
Get full text

Efficient SAT solving: beyond supercubes by Babić, Domagoj, Bingham, Jesse, Hu, Alan J.

“… Recently, Goldberg et al introduced supercubing, a different approach to search-space pruning, based on a theory that unifies many existing methods…”
Get full text