View PDF - Oriental Journal of Computer Science and Technology
... With the rapid growth in size and number of available databases in commercial, industrial, administrative and other applications, it is necessary and interesting to examine how to extract knowledge from huge amount of data. There are several mining algorithms available to solve diverse data mining p ...
... With the rapid growth in size and number of available databases in commercial, industrial, administrative and other applications, it is necessary and interesting to examine how to extract knowledge from huge amount of data. There are several mining algorithms available to solve diverse data mining p ...
state - Robotics and Embedded Systems
... Bi-directional search Problems: Operators are not always or only very diffcultly invertible (computation of parent nodes) In come cases there exist many goal states, which are described only partially. Example: predecessor state of “checkmate". One needs effcient procedures in order to test w ...
... Bi-directional search Problems: Operators are not always or only very diffcultly invertible (computation of parent nodes) In come cases there exist many goal states, which are described only partially. Example: predecessor state of “checkmate". One needs effcient procedures in order to test w ...
PNBA*: A Parallel Bidirectional Heuristic Search Algorithm
... exchange protocol. Each processor executes the following steps while the computation has not finished. It process the received states using the closed list to avoid duplications and the open list to store the nodes it will expand. If there are no more nodes to be processed, it selects the node with ...
... exchange protocol. Each processor executes the following steps while the computation has not finished. It process the received states using the closed list to avoid duplications and the open list to store the nodes it will expand. If there are no more nodes to be processed, it selects the node with ...
Applying Dynamic Weight on Theta Star Path-finding
... If we add a weight value which is greater than one into the calculation of F value the runtime will perform faster but the path is not optimal because of the increasing in its path-length. And if we add a weight value which is smaller than one into the calculation of F value the runtime will perform ...
... If we add a weight value which is greater than one into the calculation of F value the runtime will perform faster but the path is not optimal because of the increasing in its path-length. And if we add a weight value which is smaller than one into the calculation of F value the runtime will perform ...
Deliberation as Coordination through Cheap Talk ∗ Randall Calvert Washington University, St. Louis
... In this view, democratic politics does not simply aggregate preferences; more importantly, they promote the reaching of a sufficient degree of general agreement on government policies through the airing of public-regarding reasons for choosing one policy rather than another. Through deliberation, th ...
... In this view, democratic politics does not simply aggregate preferences; more importantly, they promote the reaching of a sufficient degree of general agreement on government policies through the airing of public-regarding reasons for choosing one policy rather than another. Through deliberation, th ...
Expectation-Based Versus Potential
... For the second round, the abstraction algorithm must determine how many child buckets each of the K1 first-round buckets has, subject to the constraint of having at most K2 total children. Before determining how many children each first-round bucket has, the algorithm estimates the error for each fi ...
... For the second round, the abstraction algorithm must determine how many child buckets each of the K1 first-round buckets has, subject to the constraint of having at most K2 total children. Before determining how many children each first-round bucket has, the algorithm estimates the error for each fi ...
Pathfinding in Computer Games
... map location each node has three other attributes. These are fitness, goal and heuristic commonly known as f, g , and h respectively. Different values can be assigned to paths between the nodes. Typically these values would represent the distances between the nodes. The attributes g , h , and f are ...
... map location each node has three other attributes. These are fitness, goal and heuristic commonly known as f, g , and h respectively. Different values can be assigned to paths between the nodes. Typically these values would represent the distances between the nodes. The attributes g , h , and f are ...
Game Theory and Decision Theory in Multi-Agent Systems
... ( ), the latter being affected also by whether the alternator is working and, as a result, whether the battery is recharged when the car moves. The operational state of the battery affects whether the radio and lights will work. In this network it is expected that the observations that can ...
... ( ), the latter being affected also by whether the alternator is working and, as a result, whether the battery is recharged when the car moves. The operational state of the battery affects whether the radio and lights will work. In this network it is expected that the observations that can ...
Postwar game and decision theory: a historical perspective
... • In general, a statistical decision problem (SDP) arises whenever there is a set of alternative choices and the statistician’s preference over them depends on an unknown prob distr. • Basic SDP: the statistician has to choose what “experiment” to perform (say, sampling) in order to extract informat ...
... • In general, a statistical decision problem (SDP) arises whenever there is a set of alternative choices and the statistician’s preference over them depends on an unknown prob distr. • Basic SDP: the statistician has to choose what “experiment” to perform (say, sampling) in order to extract informat ...
