Dots-And-Boxes is a well-known and widely-played combinatorial game. While the rules of play are very simple, the state space for even very small games is extremely large, and finding the outcome under optimal play is correspondingly hard. In this paper we introduce a Dots-And-Boxes solver which is significantly faster than the current state-of-the-art: over an order-of-magnitude faster on seve...

In this work we investigate several issues in order to improve the performance of probabilistic estimation trees (PETs). First, we derive a new probability smoothing that takes into account the class distributions of all the nodes from the root to each leaf. Secondly, we introduce or adapt some new splitting criteria aimed at improving probability estimates rather than improving classification ...

Internet Traffic classification is vital for various network activities such as detection of malware. Security is major issue of concern which accounts for the reputation and reliability of system. Malware effects the system adversely results in data loss or abnormal functioning. Hence, detection and as well as removal of malware is crucial. Combining set of classifiers called as ensembling pro...

-Two schools of thought exist regarding top-pruning bareroot seedlings. One school favors top-pruning due to the economic advantages. Top-pruning can reduce the production of cull seedlings (increase crop value) as well as increase the chance of survival after outplanting. Published studies suggest that top-pruning can increase overall survival of loblolly pine and longleaf pine by 7 and 13 per...

primary bud necrosis in grapevine is a physiological disorder observed in the compound buds. this study was conducted to investigate the anatomical changes in cv. askari grapevine in winter dormant buds. bud samples were taken from askari grapevine at sisakht vineyards, south-western of iran. compound buds were dissected and assessed under a binocular microscope at 10-40x magnification and a di...

Max (Luckhardt and Irani, 1986) is the extension of the minimax backup rule to multi-player games. We have shown that only a limited version of alpha-beta pruning, shallow pruning, can be applied to a max search tree. We extend this work by calculating the exact bounds needed to use this pruning technique. In addition, we show that branch-and-bound pruning, using a monotonic heuristic, has the ...

In this article we review standard null-move pruning and introduce our extended version of it, which we call verified null-move pruning. In verified null-move pruning, whenever the shallow null-move search indicates a fail-high, instead of cutting off the search from the current node, the search is continued with reduced depth. Our experiments with verified null-move pruning show that on averag...

A new class of algorithms based on the triangle inequality has recently been proposed for use in contentbased image retrieval. These algorithms rely on comparing a set of key images to the database images, and storing the computed distances. Query images are later compared to the keys, and the triangle inequality is used to speedily compute lower bounds on the distance from the query to each of...