Výsledky vyhledávání - Computing methodologies Artificial intelligence Search methodologies Game tree research~
-
1
GreedyUCB1 based Monte-Carlo Tree Search for General Video Game Playing Artificial Intelligence
ISSN: 2383-6318Vydáno: 15.08.2015Vydáno v KIISE Transactions on Computing Practices (15.08.2015)Získat plný text
Journal Article -
2
Monte-Carlo Tree Search Algorithm in Pac-Man Identification of Commonalities in 2D Video Games for Realisation in ai (Artificial Intelligence)
Vydáno: 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ískat plný text
Dissertation -
3
LEGION: Best-First Concolic Testing
ISSN: 2643-1572Vydáno: ACM 01.09.2020Vydáno v 2020 35th IEEE/ACM International Conference on Automated Software Engineering (ASE) (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ískat plný text
Konferenční příspěvek -
4
Neuromorphic Monte Carlo Tree Search Methods for Shortest Path Interdiction
Vydáno: IEEE 30.07.2024Vydáno v 2024 International Conference on Neuromorphic Systems (ICONS) (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ískat plný text
Konferenční příspěvek -
5
Adaptive bug isolation
ISBN: 9781605587196, 1605587192ISSN: 0270-5257Vydáno: New York, NY, USA ACM 01.05.2010Vydáno v 2010 ACM/IEEE 32nd International Conference on Software Engineering (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ískat plný text
Konferenční příspěvek -
6
A Tree Based Router Search Engine Architecture with Single Port Memories
ISBN: 076952270X, 9780769522708ISSN: 1063-6897Vydáno: Washington, DC, USA IEEE Computer Society 01.05.2005Vydáno v 32nd International Symposium on Computer Architecture (ISCA'05) (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ískat plný text
Konferenční příspěvek -
7
An Evolutionary Framework for Analyzing the Distance Preserving Property of Weighted Graphs
ISBN: 1450349935, 9781450349932ISSN: 2473-991XVydáno: New York, NY, USA ACM 31.07.2017Vydáno v 2017 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM) (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ískat plný text
Konferenční příspěvek -
8
A Scalable Distributed Parallel Breadth-First Search Algorithm on BlueGene/L
ISBN: 1595930612, 9781595930613Vydáno: Washington, DC, USA IEEE Computer Society 2005Vydáno v Proceedings of the 2005 ACM/IEEE conference on Supercomputing (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ískat plný text
Konferenční příspěvek -
9
Beyond games: a systematic review of neural Monte Carlo tree search applications
ISSN: 0924-669X, 1573-7497Vydáno: New York Springer US 01.01.2024Vydáno v Applied intelligence (Dordrecht, Netherlands) (01.01.2024)“…The advent of AlphaGo and its successors marked the beginning of a new paradigm in playing games using artificial intelligence…”
Získat plný text
Journal Article -
10
Multi-feature and DAG-Based Multi-tree Matching Algorithm for Automatic Web Data Mining
Vydáno: IEEE 01.08.2014Vydáno v 2014 IEEE/WIC/ACM International Joint Conferences on Web Intelligence (WI) and Intelligent Agent Technologies (IAT) (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ískat plný text
Konferenční příspěvek -
11
Developing a Deterministic Patrolling Strategy for Security Agents
ISBN: 0769538010, 9780769538013Vydáno: Washington, DC, USA IEEE Computer Society 15.09.2009Vydáno v Proceedings of the 2009 IEEE/WIC/ACM International Joint Conference on Web Intelligence and Intelligent Agent Technology - Volume 02 (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ískat plný text
Konferenční příspěvek -
12
Efficient SAT solving: beyond supercubes
ISBN: 1595930582, 9781595930583Vydáno: New York, NY, USA ACM 13.06.2005Vydáno v Proceedings 2005 : Design Automation Conference : Anaheim Convention Center, Anaheim, CA, June 13-17, 2005 (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ískat plný text
Konferenční příspěvek -
13
Multi-Agent Patrolling with Reinforcement Learning
ISBN: 9781581138641, 1581138644Vydáno: Washington, DC, USA IEEE Computer Society 19.07.2004Vydáno v Autonomous Agents and Multiagent Systems: Proceedings, 3rd International Joint Conference, New York City, New York, 2004. (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ískat plný text
Konferenční příspěvek -
14
Multi-Armed Bandit Optimization for Explainable AI Models in Chronic Kidney Disease Risk Evaluation
ISSN: 2073-8994, 2073-8994Vydáno: Basel MDPI AG 01.11.2025Vydáno v Symmetry (Basel) (01.11.2025)“…Chronic kidney disease (CKD) impacts over 850 million people globally, representing a critical public health issue, yet existing risk assessment methodologies inadequately address the complexity of disease progression trajectories…”
Získat plný text
Journal Article -
15
An improved Monte Carlo Tree Search approach to workflow scheduling
ISSN: 0954-0091, 1360-0494Vydáno: Abingdon Taylor & Francis 31.12.2022Vydáno v Connection science (31.12.2022)“… Monte Carlo Tree Search (MCTS) is a recently proposed search methodology with great success in AI research on game playing, such as Computer Go…”
Získat plný text
Journal Article -
16
An Autonomy-Oriented Paradigm for Self-Organized Computing
ISBN: 0769538010, 9780769538013Vydáno: Washington, DC, USA IEEE Computer Society 2009Vydáno v Proceedings of the 2009 IEEE/WIC/ACM International Joint Conference on Web Intelligence and Intelligent Agent Technology - Volume 02 (2009)“…A bottom-up computing paradigm, namely Autonomy-Oriented Computing (AOC), offers some principles and mechanisms for non-linearly solving computationally hard problems…”
Získat plný text
Konferenční příspěvek -
17
A Theoretical Analysis of Multi-Agent Patrolling Strategies
ISBN: 9781581138641, 1581138644Vydáno: Washington, DC, USA IEEE Computer Society 19.07.2004Vydáno v Autonomous Agents and Multiagent Systems: Proceedings, 3rd International Joint Conference, New York City, New York, 2004. (19.07.2004)Získat plný text
Konferenční příspěvek -
18
Fear Detection Using Electroencephalogram and Artificial Intelligence: A Systematic Review
ISSN: 2076-3425, 2076-3425Vydáno: Switzerland MDPI AG 29.07.2025Vydáno v Brain sciences (29.07.2025)“… This systematic review aimed to identify the most effective methods, algorithms, and configurations reported in the literature for detecting fear from EEG signals using artificial intelligence (AI). Methods…”
Získat plný text
Journal Article -
19
Cluster-Swap: A Distributed K-median Algorithm for Sensor Networks
ISBN: 0769538010, 9780769538013Vydáno: Washington, DC, USA IEEE Computer Society 15.09.2009Vydáno v Proceedings of the 2009 IEEE/WIC/ACM International Joint Conference on Web Intelligence and Intelligent Agent Technology - Volume 02 (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ískat plný text
Konferenční příspěvek -
20
The M2M Pathfinding Algorithm Based on the Idea of Granular Computing
ISBN: 0769538010, 9780769538013Vydáno: Washington, DC, USA IEEE Computer Society 15.09.2009Vydáno v Proceedings of the 2009 IEEE/WIC/ACM International Joint Conference on Web Intelligence and Intelligent Agent Technology - Volume 02 (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ískat plný text
Konferenční příspěvek

