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

Refine Results
  1. 1

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

    ISSN: 2643-1572
    Published: 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…”
    Get full text
    Conference Proceeding
  2. 2

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

    Published: 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…”
    Get full text
    Conference Proceeding
  3. 3

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

    Published: 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…”
    Get full text
    Conference Proceeding
  4. 4

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

    ISBN: 9781605587196, 1605587192
    ISSN: 0270-5257
    Published: 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…”
    Get full text
    Conference Proceeding
  5. 5

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

    Published: 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…”
    Get full text
    Conference Proceeding
  6. 6

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

    ISBN: 076952270X, 9780769522708
    ISSN: 1063-6897
    Published: 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…”
    Get full text
    Conference Proceeding
  7. 7

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

    ISSN: 2153-697X
    Published: 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…”
    Get full text
    Conference Proceeding
  8. 8

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

    ISBN: 1450349935, 9781450349932
    ISSN: 2473-991X
    Published: 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…”
    Get full text
    Conference Proceeding
  9. 9

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

    ISBN: 1595930612, 9781595930613
    Published: 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…”
    Get full text
    Conference Proceeding
  10. 10

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

    ISBN: 1595930582, 9781595930583
    Published: 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…”
    Get full text
    Conference Proceeding
  11. 11

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

    Published: 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…”
    Get full text
    Conference Proceeding
  12. 12

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

    ISBN: 9781581138641, 1581138644
    Published: 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…”
    Get full text
    Conference Proceeding
  13. 13

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

    ISBN: 0769538010, 9780769538013
    Published: 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…”
    Get full text
    Conference Proceeding
  14. 14

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

    ISBN: 0769538010, 9780769538013
    Published: 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…”
    Get full text
    Conference Proceeding
  15. 15
  16. 16

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

    ISBN: 0769538010, 9780769538013
    Published: 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…”
    Get full text
    Conference Proceeding
  17. 17

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

    ISBN: 0769538010, 9780769538013
    Published: 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…”
    Get full text
    Conference Proceeding
  18. 18

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

    ISSN: 2643-1572
    Published: 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…”
    Get full text
    Conference Proceeding
  19. 19

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

    ISBN: 1424400546, 9781424400546
    Published: 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…”
    Get full text
    Conference Proceeding
  20. 20

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

    Published: 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…”
    Get full text
    Conference Proceeding