Data storage, reading and continuous monitoring of point pixels have been well solved in design of time sequence logic.
在时序逻辑设计中,较好地解决了数据的存储、读取和点像元数据连续监测。
The problem of continuous MAX query over sliding window data streams is addressed, and an optimal storage method is proposed.
考虑滑动窗口数据流上的连续MAX查询问题,提出了一种存储最优的方法。
With the continuous expansion of social information, the amount of data from the shortest path problem is very large, so both the computing time and the storage space increase significantly.
随着社会信息的不断膨胀,最短路径问题所面临的数据量是非常庞大的,求解的计算时间和存储空间大大增加。
应用推荐