Some of the results I find for CTMP are Continuous Time Markov Processes. Here is a slide deck with poor kerning[0]. From an interesting slide: Numerical solut

Some of the results I find for CTMP are Continuous Time Markov Processes. Here is a slide deck with poor kerning[0]. From an interesting slide: Numerical solution of implicitly encoded CTMCs If R is stored as a sparse matrix of columns, a Jacobi or GaussSeidel iteration has the cost of a vector-matrix multiplication, O(n(R)) If R is stored using implicit techniques (Kronecker algebra or decision diagrams), memory is greatly reduced but runtime can increase. E.g., using Shuffle to compute the effect of v, (pi)^(old) . (operator)(L<k<1) R(k,v1), is slower than Sparse multiplication if the R(k,v) matrices are very sparse. This research paper describes tracking cattle with a wireless sensor network[1]. --- Or this could be Cisco Technology Migration Program[2]. They could have some sort of network probe to identify "upgrade-ready" products, which could be leveraged for other purposes. --- [0] http://www.cs.ucr.edu/~cshelton/talks/ctmp-tut.pdf http://www.cs.ucr.edu/~cshelton/talks/ctmp-tut.pdf [1] https://www.researchgate.net/publication/271419298_Cattle_monitoring_system_using_wireless_sensor_network_in_order_to_prevent_cattle_rustling https://www.researchgate.net/publication/271419298_Cattle_mo... [2] https://www.cisco.com/web/partners/pr11/incentive/emea/tmp.html https://www.cisco.com/web/partners/pr11/incentive/emea/tmp.h...