In this work we investigate the potential of combining AI tree-search algorithms with the algorithms of combinatorial game theory to provide more efficient strategies for playing s...
This paper initially presents a brief but fairly exhaustive survey of solutions to the concurrency control problem for B-trees. We then propose a new solution, which is characteri...
In hardware implementation for the finite field, the use of normal basis has several advantages, especially the optimal normal basis is the most efficient to hardware implementati...
Chang Han Kim, Yongtae Kim, Sung Yeon Ji, IlWhan P...
Many real-world data are maintained in relational format, with different tables storing information about entities and their links or relationships. The structure (schema) of the ...
Oliver Schulte, Hassan Khosravi, Flavia Moser, Mar...
7 Major problems exist in both crisp and fuzzy clustering algorithms. The fuzzy c-means type of algorithms use weights determined by a power m of inverse distances that remains