Výsledky vyhledávání - "Computing methodologies Artificial intelligence Search methodologies Discrete space search"

Optimizing Tensor Computation Graphs with Equality Saturation and Monte Carlo Tree Search Autor 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…”
Získat plný text

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

“…Concolic execution and fuzzing are two complementary coverage-based testing techniques. How to achieve the best of both remains an open challenge. To address…”
Získat plný text

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

“…Gradient-boosted trees and random forests are among the most popular machine learning algorithms. They are applied to a broad spectrum of applications as…”
Získat plný text

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

“…Statistical debugging uses lightweight instrumentation and statistical models to identify program behaviors that are strongly predictive of failure. However,…”
Získat plný text

Quantum Circuit Compilers Using Gate Commutation Rules Autor 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…”
Získat plný text

Neuromorphic Monte Carlo Tree Search Methods for Shortest Path Interdiction Autor 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…”
Získat plný text

A Tree Based Router Search Engine Architecture with Single Port Memories Autor 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…”
Získat plný text

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

“…Many emerging large-scale data science applications require searching large graphs distributed across multiple memories and processors. This paper presents a…”
Získat plný text

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

“…A subgraph H of a given graph G is isometric if the distances between every pair of vertices in H are the same as the distances of those vertices in G. We say…”
Získat plný text

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

“…SAT (Boolean satisfiability) has become the primary Boolean reasoning engine for many EDA applications, so the efficiency of SAT solving is of great practical…”
Získat plný text

Multi-feature and DAG-Based Multi-tree Matching Algorithm for Automatic Web Data Mining Autor 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…”
Získat plný text

Multi-Agent Patrolling with Reinforcement Learning Autor 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…”
Získat plný text

Developing a Deterministic Patrolling Strategy for Security Agents Autor 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…”
Získat plný text

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

“…Macro-to-micro (M2M) model is an implementation model that inherits the GrC idea and extends it to some additional highly desirable characteristics. In this…”
Získat plný text

Cluster-Swap: A Distributed K-median Algorithm for Sensor Networks Autor 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…”
Získat plný text

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

Získat plný text

An Autonomy-Oriented Paradigm for Self-Organized Computing Autor 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…”
Získat plný text

Parallel multiple sequence alignment with local phylogeny search by simulated annealing Autor 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…”
Získat plný text

On mask layout partitioning for electron projection lithography Autor Tian, Ruiqi, Yu, Ronggang, Tang, Xiaoping, Wong, D. F.

“…Electron projection lithography (EPL) is a leading candidate for next generation lithography (NGL) in VLSI production. The membrane mask used in EPL is divided…”
Získat plný text

Accelerating parallel maximum likelihood-based phylogenetic tree calculations using subtree equality vectors Autor Stamatakis, Alexandros P., Ludwig, Thomas, Meier, Harald, Wolf, Marty J.

“…Heuristics for calculating phylogenetic trees for a large sets of aligned rRNA sequences based on the maximum likelihood method are computationally expensive…”
Získat plný text