Výsledky vyhľadávania - Computing methodologies Artificial intelligence Search methodologies Game tree search
-
1
GreedyUCB1 based Monte-Carlo Tree Search for General Video Game Playing Artificial Intelligence
ISSN: 2383-6318Vydavateľské údaje: 15.08.2015Vydané v KIISE Transactions on Computing Practices (15.08.2015)Získať 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)
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
LEGION: Best-First Concolic Testing
ISSN: 2643-1572Vydavateľské údaje: ACM 01.09.2020Vydané 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ískať plný text
Konferenčný príspevok.. -
4
Adaptive bug isolation
ISBN: 9781605587196, 1605587192ISSN: 0270-5257Vydavateľské údaje: New York, NY, USA ACM 01.05.2010Vydané 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ískať plný text
Konferenčný príspevok.. -
5
Neuromorphic Monte Carlo Tree Search Methods for Shortest Path Interdiction
Vydavateľské údaje: IEEE 30.07.2024Vydané 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ískať plný text
Konferenčný príspevok.. -
6
A Tree Based Router Search Engine Architecture with Single Port Memories
ISBN: 076952270X, 9780769522708ISSN: 1063-6897Vydavateľské údaje: Washington, DC, USA IEEE Computer Society 01.05.2005Vydané 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ískať plný text
Konferenčný príspevok.. -
7
An Evolutionary Framework for Analyzing the Distance Preserving Property of Weighted Graphs
ISBN: 1450349935, 9781450349932ISSN: 2473-991XVydavateľské údaje: New York, NY, USA ACM 31.07.2017Vydané 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ískať plný text
Konferenčný príspevok.. -
8
A Scalable Distributed Parallel Breadth-First Search Algorithm on BlueGene/L
ISBN: 1595930612, 9781595930613Vydavateľské údaje: Washington, DC, USA IEEE Computer Society 2005Vydané 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ískať plný text
Konferenčný príspevok.. -
9
Efficient SAT solving: beyond supercubes
ISBN: 1595930582, 9781595930583Vydavateľské údaje: New York, NY, USA ACM 13.06.2005Vydané 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ískať plný text
Konferenčný príspevok.. -
10
Multi-feature and DAG-Based Multi-tree Matching Algorithm for Automatic Web Data Mining
Vydavateľské údaje: IEEE 01.08.2014Vydané 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ískať plný text
Konferenčný príspevok.. -
11
Multi-Agent Patrolling with Reinforcement Learning
ISBN: 9781581138641, 1581138644Vydavateľské údaje: Washington, DC, USA IEEE Computer Society 19.07.2004Vydané 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ískať plný text
Konferenčný príspevok.. -
12
Developing a Deterministic Patrolling Strategy for Security Agents
ISBN: 0769538010, 9780769538013Vydavateľské údaje: Washington, DC, USA IEEE Computer Society 15.09.2009Vydané 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ískať plný text
Konferenčný príspevok.. -
13
An Autonomy-Oriented Paradigm for Self-Organized Computing
ISBN: 0769538010, 9780769538013Vydavateľské údaje: Washington, DC, USA IEEE Computer Society 2009Vydané 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ískať plný text
Konferenčný príspevok.. -
14
A Theoretical Analysis of Multi-Agent Patrolling Strategies
ISBN: 9781581138641, 1581138644Vydavateľské údaje: Washington, DC, USA IEEE Computer Society 19.07.2004Vydané v Autonomous Agents and Multiagent Systems: Proceedings, 3rd International Joint Conference, New York City, New York, 2004. (19.07.2004)Získať plný text
Konferenčný príspevok.. -
15
Cluster-Swap: A Distributed K-median Algorithm for Sensor Networks
ISBN: 0769538010, 9780769538013Vydavateľské údaje: Washington, DC, USA IEEE Computer Society 15.09.2009Vydané 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ískať plný text
Konferenčný príspevok.. -
16
The M2M Pathfinding Algorithm Based on the Idea of Granular Computing
ISBN: 0769538010, 9780769538013Vydavateľské údaje: Washington, DC, USA IEEE Computer Society 15.09.2009Vydané 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ískať plný text
Konferenčný príspevok.. -
17
Accelerating parallel maximum likelihood-based phylogenetic tree calculations using subtree equality vectors
ISBN: 076951524X, 9780769515243Vydavateľské údaje: Los Alamitos, CA, USA IEEE Computer Society Press 16.11.2002Vydané v Proceedings of the 2002 ACM/IEEE conference on Supercomputing (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
Assessment by belief
ISBN: 9780769509662, 0769509665Vydavateľské údaje: Washington, DC, USA IEEE Computer Society 29.01.2001Vydané v Proceedings of the 12th Australasian database conference (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
Connectivity shapes
ISBN: 078037200X, 9780780372009Vydavateľské údaje: Washington, DC, USA IEEE Computer Society 21.10.2001Vydané v Proceedings of the conference on Visualization '01 (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
Parallel interval-Newton using message passing: dynamic load balancing strategies
ISBN: 9781581132939, 158113293XVydavateľské údaje: New York, NY, USA ACM 10.11.2001Vydané v Proceedings of the 2001 ACM/IEEE Conference on Supercomputing (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..

