Výsledky vyhľadávania - Computing methodologies Artificial intelligence Search methodologies Discrete space search

  1. 1

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

    ISSN: 2643-1572
    Vydavateľské údaje: ACM 01.09.2020
    “… 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…”
    Získať plný text
    Konferenčný príspevok..
  2. 2

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

    Vydavateľské údaje: IEEE 21.10.2023
    “… 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…”
    Získať plný text
    Konferenčný príspevok..
  3. 3

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

    Vydavateľské údaje: ACM 13.10.2024
    “…The real-world effectiveness of deep neural networks often depends on their latency, thereby necessitating optimization techniques that can reduce a model's…”
    Získať plný text
    Konferenčný príspevok..
  4. 4

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

    ISBN: 9781605587196, 1605587192
    ISSN: 0270-5257
    Vydavateľské údaje: New York, NY, USA ACM 01.05.2010
    “… 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…”
    Získať plný text
    Konferenčný príspevok..
  5. 5

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

    Vydavateľské údaje: IEEE 30.07.2024
    “…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…”
    Získať plný text
    Konferenčný príspevok..
  6. 6

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

    ISBN: 076952270X, 9780769522708
    ISSN: 1063-6897
    Vydavateľské údaje: Washington, DC, USA IEEE Computer Society 01.05.2005
    “…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…”
    Získať plný text
    Konferenčný príspevok..
  7. 7

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

    ISSN: 2153-697X
    Vydavateľské údaje: ACM 21.01.2019
    “…The use of noisy intermediate-scale quantum computers (NISQCs), which consist of dozens of noisy qubits with limited coupling constraints, has been increasing…”
    Získať plný text
    Konferenčný príspevok..
  8. 8

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

    ISBN: 1450349935, 9781450349932
    ISSN: 2473-991X
    Vydavateľské údaje: New York, NY, USA ACM 31.07.2017
    “… 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…”
    Získať plný text
    Konferenčný príspevok..
  9. 9

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

    ISBN: 1595930612, 9781595930613
    Vydavateľské údaje: Washington, DC, USA IEEE Computer Society 2005
    “… 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…”
    Získať plný text
    Konferenčný príspevok..
  10. 10

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

    ISBN: 1595930582, 9781595930583
    Vydavateľské údaje: New York, NY, USA ACM 13.06.2005
    “… Recently, Goldberg et al introduced supercubing, a different approach to search-space pruning, based on a theory that unifies many existing methods…”
    Získať plný text
    Konferenčný príspevok..
  11. 11

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

    Vydavateľské údaje: IEEE 01.08.2014
    “…Web data extraction has received considerable attention and study in recent decades. To improve efficiency, many automatic Web data record mining approaches…”
    Získať plný text
    Konferenčný príspevok..
  12. 12

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

    ISBN: 9781581138641, 1581138644
    Vydavateľské údaje: Washington, DC, USA IEEE Computer Society 19.07.2004
    “…Patrolling tasks can be encountered in a variety of real-world domains, ranging from computer network administration and surveillance to computer wargame…”
    Získať plný text
    Konferenčný príspevok..
  13. 13

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

    ISBN: 0769538010, 9780769538013
    Vydavateľské údaje: Washington, DC, USA IEEE Computer Society 15.09.2009
    “…Developing autonomous systems that patrol environments for detecting intruders is a topic of increasing relevance in security applications. An important aspect…”
    Získať plný text
    Konferenčný príspevok..
  14. 14

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

    ISBN: 0769538010, 9780769538013
    Vydavateľské údaje: Washington, DC, USA IEEE Computer Society 2009
    “…A bottom-up computing paradigm, namely Autonomy-Oriented Computing (AOC), offers some principles and mechanisms for non-linearly solving computationally hard problems…”
    Získať plný text
    Konferenčný príspevok..
  15. 15
  16. 16

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

    ISBN: 0769538010, 9780769538013
    Vydavateľské údaje: Washington, DC, USA IEEE Computer Society 15.09.2009
    “…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ískať plný text
    Konferenčný príspevok..
  17. 17

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

    ISBN: 0769538010, 9780769538013
    Vydavateľské údaje: Washington, DC, USA IEEE Computer Society 15.09.2009
    “…) 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…”
    Získať plný text
    Konferenčný príspevok..
  18. 18

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

    ISSN: 2643-1572
    Vydavateľské údaje: IEEE 11.09.2023
    “… Moreover, the adversarial example generation techniques specific to deep code models still suffer from unsatisfactory effectiveness due to the enormous ingredient search space…”
    Získať plný text
    Konferenčný príspevok..
  19. 19

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

    ISBN: 1424400546, 9781424400546
    Vydavateľské údaje: Washington, DC, USA IEEE Computer Society 25.04.2006
    “…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ískať plný text
    Konferenčný príspevok..
  20. 20

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

    Vydavateľské údaje: IEEE 09.07.2023
    “… 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…”
    Získať plný text
    Konferenčný príspevok..