In this paper, the minimum sufficient set problem in bi-directed networks is studied.
研究在双向网络中的最小充分集问题,并把他转化为最小顶点覆盖问题。
In cases where the requirements team actually finds a sufficient set before the time runs out, they invariably go on to invent more requirements rather than declare the task complete.
如果在时间运行完之前需求团队确实找到了足够充分的集合,在这种情况下,他们总是继续发明更多的需求而不是声明任务已经完成。
Time will show whether this simple set of resources and API will prove to be sufficient for building and using clouds or a more complex API set is going to be required.
时间会告诉我们这一简单的资源和API集合是否能被证明是足够用于构建和使用云的,或者说我们将会需要更加复杂的API集合。
应用推荐