Collection
Degree Department
2 Matching Results
Results open in a new window/tab.
Results:
1 - 2 of
2
Solving the (n² - 1)-Puzzle with 8/3 n³ Expected Moves
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
System:
The UNT Digital Library
Predicting changes in systolic blood pressure using longitudinal patient records
This article introduces a model that predicts future changes in systolic blood pressure (SBP) based on structured and unstructured (text-based) information from longitudinal clinical records.
Date:
July 22, 2015
Creator:
Solomon, John Wes & Nielsen, Rodney D.
System:
The UNT Digital Library