Výsledky vyhľadávania - Computing methodologies Artificial intelligence Search methodologies Game tree search

  1. 1
  2. 2

    Monte-Carlo Tree Search Algorithm in Pac-Man Identification of Commonalities in 2D Video Games for Realisation in ai (Artificial Intelligence) Autor Tilkidagi, Salman

    Vydavateľské údaje: ProQuest Dissertations & Theses 01.01.2021
    “… (achieving similar scores and, in some instances, higher scores than humans). The research is dedicated to the game strategy, which uses the Monte-Carlo Tree Search algorithm for the PacMan agent…”
    Získať plný text
    Dissertation
  3. 3

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

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

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

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

    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
    “… In this paper, we propose a new multi-feature and DAG (Directed Acyclic Graph) based multi-tree matching algorithm for automatic data item alignment…”
    Získať plný text
    Konferenčný príspevok..
  11. 11

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

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

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

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

    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
    “…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ískať plný text
    Konferenčný príspevok..
  17. 17

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

    ISBN: 076951524X, 9780769515243
    Vydavateľské údaje: Los Alamitos, CA, USA IEEE Computer Society Press 16.11.2002
    “…Heuristics for calculating phylogenetic trees for a large sets of aligned rRNA sequences based on the maximum likelihood method are computationally expensive…”
    Získať plný text
    Konferenčný príspevok..
  18. 18

    Assessment by belief Autor Miura, Takao, Shioya, Isamu

    ISBN: 9780769509662, 0769509665
    Vydavateľské údaje: Washington, DC, USA IEEE Computer Society 29.01.2001
    “…We discuss how to post-evaluate inductive classification based on users belief. Although we could learn classification rules inductively by means of decision tree generation, we wonder whether it is consistent with our utilization…”
    Získať plný text
    Konferenčný príspevok..
  19. 19

    Connectivity shapes Autor Isenburg, Martin, Gumhold, Stefan, Gotsman, Craig

    ISBN: 078037200X, 9780780372009
    Vydavateľské údaje: Washington, DC, USA IEEE Computer Society 21.10.2001
    “…We describe a method to visualize the connectivity graph of a mesh using a natural embedding in 3D space. This uses a 3D shape representation that is based…”
    Získať plný text
    Konferenčný príspevok..
  20. 20

    Parallel interval-Newton using message passing: dynamic load balancing strategies Autor Gau, Chao-Yang, Stadtherr, Mark A.

    ISBN: 9781581132939, 158113293X
    Vydavateľské údaje: New York, NY, USA ACM 10.11.2001
    “… The corresponding binary tree structure provides a natural parallelism allowing concurrent evaluation of subproblems using parallel computing technology…”
    Získať plný text
    Konferenčný príspevok..