UNT College of Engineering - Browse

ABOUT BROWSE FEED

Solving the (n² - 1)-Puzzle with 8/3 n³ Expected Moves

Description: In this article, it is shown that the greedy algorithm for the (n² - 1)-puzzle makes 8/3 + O(n²) expected moves. This analysis is verified experimentally on 10,000 random instances each of the (n² - 1)-puzzle for 4 ≤ n ≤ 200.
Date: July 10, 2015
Creator: Parberry, Ian

Specialized Research Datasets in the CiteSeer˟ Digital Library

Description: This article provides an overview of some of the specialized datasets that were created for various projects related to the CiteSeer˟ digital library.
Date: 2012
Creator: Bhatia, Sumit; Caragea, Cornelia; Chen, Hung-Hsuan; Wu, Jian; Treeratpituk, Pucktada; Wu, Zhaohui et al.

Virtualization Based Secure Execution And Testing Framework

Description: Article discussing the use of a virtualization software to build a Virtualization Based Secure Execution and Testing Framework for testing hardware secure architectures.
Date: December 2011
Creator: Kotikela, Srujan Das; Nimgaonkar, Satyajeet & Gomathisankaran, Mahadevan