Partner
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
Object Type:
Article
System:
The UNT Digital Library
Cyber-Physical Systems Can Make Emergency Response Smart
This paper from the Humanitarian Technology: Science, Systems and Global Impact 2015 conference proceedings discusses the Smart Emergency Response System prototype built in the context of the SmartAmerica Challenge 2013-2014 by a team of nine organizations led by MathWorks.
Date:
July 7, 2015
Creator:
Zander, Justyna; Mosterman, Pieter J.; Padir, Taskin; Wan, Yan & Fu, Shengli
Object Type:
Paper
System:
The UNT Digital Library