In this paper, new complexity and approximation results for the problems under consideration are provided, which extend the ones previously obtained. Namely, for the discrete scenario uncertainty representation it is proven that if the number of scenarios is a part of the input, then the max-min...
We settle the complexity of the Independent Set Reconfiguration problem on bipartite graphs under all three commonly studied reconfiguration models. We show that under the token jumping or token addition/removal model the problem is NP-complete. For the token sliding model, we show that the problem...
-FindAll指示发现过程查找 Exchange 组织中的所有移动设备。 展开表 类型: SwitchParameter Position: Named 默认值: None 必需: False 接受管道输入: False 接受通配符: False-ForceWildcardHandling此参数处理通配符,并可能导致意外行为, (不建议) 。 不能将其与 DisableWildcardHandling 组合使用。 展开表 类型...
1 Similarly, when facing the problem according to the service approach, the complexity is also NP-complete. In so far as we are looking for solutions that minimize the allocation costs, we are dealing with an NP-hard problem. View article Railway crew scheduling: Models, methods and ...
This paper studies Lipschitz properties, relative to the parameter p, of the set of solutions to problems of the form\\\[{ext{find }}z \\\in \\\Omega _p... AL Dontchev,WW Hager - 《Siam Journal on Control & Optimization》 被引量: 266发表: 1993年 Complexity of differential and int...
Using privacy-preserving DNF operations on distributed sets, it is possible to find set union, (threshold) set intersection, and a set of k-repeated ... JY Chun,D Hong,IR Jeong,... - 《Information Sciences》 被引量: 20发表: 2013年 On the Communication Complexity of Distributed Set-Joins...
[1977]. Actually, we have skipped over some of the complexity of the last two axioms. We shall not explain at this point precisely what is meant by “function” or “property;” those terms mean approximately what one would expect them to mean, but foraxiomatic set theorythe functionfor ...
Reducing computational complexity in determining t 优质文献 相似文献 参考文献Generation of feasible set points and control of a cable robot Cable-suspended robots are structurally similar to parallel-actuated robots, but with the fundamental difference that cables can only pull the end-effector... SR...
C Bermudez-Santana,SO Attolini,T Kirsten,... - 《Bmc Genomics》 被引量: 73发表: 2010年 On the complexity and approximation of syntenic distance The paper studies the computational complexity and approximation algorithms for a new evolutionary distance between multi-chromosomal genomes introduced re....
could not find part of the path Could not find type… Please make sure that the assembly that contains this type is referenced Could not load file or assembly 'ClosedXML' or one of its dependencies. Could not load file or assembly 'file:///C:\Program Files (x86)\SAP BusinessObjects\Crys...