Suchergebnisse - Computing methodologies Artificial intelligence Search methodologies Discrete space search

LEGION: Best-First Concolic Testing von 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 …”
Volltext

Accelerating Decision-Tree-Based Inference Through Adaptive Parallelization von 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 …”
Volltext

Optimizing Tensor Computation Graphs with Equality Saturation and Monte Carlo Tree Search von 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 …”
Volltext

Adaptive bug isolation von 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 …”
Volltext

Neuromorphic Monte Carlo Tree Search Methods for Shortest Path Interdiction von 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 …”
Volltext

A Tree Based Router Search Engine Architecture with Single Port Memories von 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 …”
Volltext

Quantum Circuit Compilers Using Gate Commutation Rules von 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 …”
Volltext

An Evolutionary Framework for Analyzing the Distance Preserving Property of Weighted Graphs von 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 …”
Volltext

A Scalable Distributed Parallel Breadth-First Search Algorithm on BlueGene/L von 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 …”
Volltext

Efficient SAT solving: beyond supercubes von 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 …”
Volltext

Multi-feature and DAG-Based Multi-tree Matching Algorithm for Automatic Web Data Mining von Shengsheng Shi, Chengfei Liu, Chunfeng Yuan, Yihua Huang

“… Web data extraction has received considerable attention and study in recent decades. To improve efficiency, many automatic Web data record mining approaches …”
Volltext

Multi-Agent Patrolling with Reinforcement Learning von Santana, Hugo, Ramalho, Geber, Corruble, Vincent, Ratitch, Bohdana

“… Patrolling tasks can be encountered in a variety of real-world domains, ranging from computer network administration and surveillance to computer wargame …”
Volltext

Developing a Deterministic Patrolling Strategy for Security Agents von Basilico, Nicola, Gatti, Nicola, Amigoni, Francesco

“… Developing autonomous systems that patrol environments for detecting intruders is a topic of increasing relevance in security applications. An important aspect …”
Volltext

An Autonomy-Oriented Paradigm for Self-Organized Computing von Liu, Jiming, Gao, Chao, Zhong, Ning

“… A bottom-up computing paradigm, namely Autonomy-Oriented Computing (AOC), offers some principles and mechanisms for non-linearly solving computationally hard problems …”
Volltext

A Theoretical Analysis of Multi-Agent Patrolling Strategies von Chevaleyre, Yann, Sempe, Francois, Ramalho, Geber

Volltext

Cluster-Swap: A Distributed K-median Algorithm for Sensor Networks von Kim, Yoonheui, Lesser, Victor, Ganesan, Deepak, Sitaraman, Ramesh

“… In building practical sensor networks, it is often beneficial to use only a subset of sensors to take measurements because of computational, communication, and …”
Volltext

The M2M Pathfinding Algorithm Based on the Idea of Granular Computing von Wan, Haifeng, Zhang, Yingpeng, Luo, Shengzhou, Liu, Ruijie, Ye, Wensheng

“… ) bit memory space and can be updated in O(1) expected time to handle changes. Although the resulting path is not always the shortest one, it can make a trade-off …”
Volltext

Code Difference Guided Adversarial Example Generation for Deep Code Models von 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 …”
Volltext

Parallel multiple sequence alignment with local phylogeny search by simulated annealing von Zola, Jaroslaw, Trystram, Denis, Tchernykh, Andrei, Brizuela, Carlos

“… The problem of multiple sequence alignment is one of the most important problems in computational biology. In this paper we present a new method that …”
Volltext

PertNAS: Architectural Perturbations for Memory-Efficient Neural Architecture Search von 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 …”
Volltext