Search Results - Computing methodologies Artificial intelligence Search methodologies Game tree search

GreedyUCB1 based Monte-Carlo Tree Search for General Video Game Playing Artificial Intelligence by Park, Hyunsoo, Kim, HyunTae, Kim, KyungJoong

Get full text

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

“… (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…”
Get full text

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

“… 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

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

“… 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

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

“…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

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

“…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

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

“… 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

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

“… 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

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

“… 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

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

“… In this paper, we propose a new multi-feature and DAG (Directed Acyclic Graph) based multi-tree matching algorithm for automatic data item alignment…”
Get full text

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

“…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

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

“…Developing autonomous systems that patrol environments for detecting intruders is a topic of increasing relevance in security applications. An important aspect…”
Get full text

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

“…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

A Theoretical Analysis of Multi-Agent Patrolling Strategies by Chevaleyre, Yann, Sempe, Francois, Ramalho, Geber

Get full text

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

“…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

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

“…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…”
Get full text

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

“…Heuristics for calculating phylogenetic trees for a large sets of aligned rRNA sequences based on the maximum likelihood method are computationally expensive…”
Get full text

Assessment by belief by Miura, Takao, Shioya, Isamu

“…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…”
Get full text

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

“…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…”
Get full text

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

“… The corresponding binary tree structure provides a natural parallelism allowing concurrent evaluation of subproblems using parallel computing technology…”
Get full text