In this article, a specific production scheduling problem (PSP), the Parallel Machine Scheduling Problem (PMSP) with Job and Sequence Setup Times, Due Dates Maintenance Times is presented. article after introduction literature review mathematical model of Machines After that Monte Carlo Tree Search Simulated Annealing are detailed. Our representation technique its evaluation also introduced. th...

We tackle the problem of goal-directed graph construction: given a starting graph, finding set edges whose addition maximally improves global objective function. This emerges in many transportation and infrastructure networks that are critical importance to society. identify two significant shortcomings present reinforcement learning methods: their exclusive focus on topology detriment spatial ...

Abstract Monte Carlo Tree Search (MCTS) is a search technique that in the last decade emerged as major breakthrough for Artificial Intelligence applications regarding board- and video-games. In 2016, AlphaGo, an MCTS-based software agent, outperformed human world champion of board game Go. This was long considered almost infeasible machines, due to its immense space need long-term strategy. Sin...

dexsy2 is a dental expert system, which diagnoses oral diseases and offers a treatment course. the system which is designed and implemented from scratch is capable of diagnosing among thirty five oral diseases and offering a course of treatment for each. it uses a decision tree for its representation of knowledge, and each of its nodes contains a frame. the knowledge base of the system contains...

Recently, rollout-based planning and search methods have emerged as an alternative to traditional tree-search methods. The fundamental operation in rollout-based tree search is the generation of trajectories in the search tree from root to leaf. Game-playing programs based on Monte-Carlo rollouts methods such as “UCT” have proven remarkably effective at using information from trajectories to ma...

We consider the task of nearest-neighbor search with the class of binary-spacepartitioning trees, which includes kd-trees, principal axis trees and random projection trees, and try to rigorously answer the question “which tree to use for nearestneighbor search?” To this end, we present the theoretical results which imply that trees with better vector quantization performance have better search ...