نتایج جستجو برای: minimal cut set
تعداد نتایج: 856429 فیلتر نتایج به سال:
Determining the minimum dominating set in connected graphs is one of most difficult problems defined as NP-hard. In this problem, it aimed to determine important nodes that can influence all via number on graph. study, an efficient near optimal algorithm showing a deterministic approach has been developed different from approximation algorithms mentioned literature for discovering set. The O(n3...
In this paper we compare the architecture of early computing devices trying to understand if they contain the minimal structure needed to qualify as universal computers. Our intention is to bring some order into the discussion about the inventor or inventors of the computer by adopting a clear cut definition of such devices. We consider the minimal structure and the minimal instruction set comp...
To tackle the problem with inexact, uncertainty and vague knowl- edge, constructive method is utilized to formulate lower and upper approx- imation sets. Rough set model over dual-universes in fuzzy approximation space is constructed. In this paper, we introduce the concept of rough set over dual-universes in fuzzy approximation space by means of cut set. Then, we discuss properties of rough se...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید