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

  1. 1

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

    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
    “… How to achieve the best of both remains an open challenge. To address this research problem, we propose and evaluate Legion…”
    Získať plný text
    Konferenčný príspevok..
  3. 3

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

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

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

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

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

    Vydavateľské údaje: IEEE 09.07.2023
    “…Design optimization of modern microprocessors is a complex task due to the exponential growth of the design space…”
    Získať plný text
    Konferenčný príspevok..
  8. 8

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

    Beyond the Yield Barrier: Variational Importance Sampling Yield Analysis Autor Liu, Yanfang, He, Lei, Xing, Wei W.

    ISSN: 1558-2434
    Vydavateľské údaje: ACM 27.10.2024
    “…Optimal mean shift vector (OMSV)-based importance sampling methods have long been prevalent in yield estimation and optimization as an industry standard…”
    Získať plný text
    Konferenčný príspevok..
  10. 10

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

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

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

    ISSN: 1432-7643, 1433-7479
    Vydavateľské údaje: Berlin/Heidelberg Springer Berlin Heidelberg 01.04.2021
    Vydané v Soft computing (Berlin, Germany) (01.04.2021)
    “…Cloud computing attracted great attention in both industry and research communities for the sake of its ubiquitous, elasticity and economic services…”
    Získať plný text
    Journal Article
  13. 13

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

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

    ISSN: 1432-7643, 1433-7479
    Vydavateľské údaje: Berlin/Heidelberg Springer Berlin Heidelberg 01.06.2017
    Vydané v Soft computing (Berlin, Germany) (01.06.2017)
    “… In this research work, discrete wavelet transform (DWT) and undecimated discrete wavelet transform (UDWT…”
    Získať plný text
    Journal Article
  15. 15

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

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

    Vydavateľské údaje: IEEE 10.11.2022
    “… The pseudoinverse may be computed explicitly via pseudoinversion; yet, this takes cubic time in practice and quadratic space…”
    Získať plný text
    Konferenčný príspevok..
  17. 17

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

    ISSN: 1558-2434
    Vydavateľské údaje: ACM 27.10.2024
    “…) framework to efficiently search the solution space and resolve conflicts during the search process…”
    Získať plný text
    Konferenčný príspevok..
  18. 18

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

    ISSN: 1432-7643, 1433-7479
    Vydavateľské údaje: Berlin/Heidelberg Springer Berlin Heidelberg 01.04.2024
    Vydané v Soft computing (Berlin, Germany) (01.04.2024)
    “… it. The arithmetic optimization algorithm (AOA) is a new optimization algorithm that can effectively solve both continuous and discrete optimization problems…”
    Získať plný text
    Journal Article
  19. 19

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

    ISSN: 1568-4946, 1872-9681
    Vydavateľské údaje: Elsevier B.V 01.03.2016
    Vydané v Applied soft computing (01.03.2016)
    “…).•An effective hyper-heuristic approach operating with ADLs is proposed.•Low level heuristics perform search over the space of feasible solutions…”
    Získať plný text
    Journal Article
  20. 20

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