بدائل البحث:
hard » had (توسيع البحث)
farm » form (توسيع البحث), far (توسيع البحث), firm (توسيع البحث)
removes. » remove. (توسيع البحث)
evolved. » resolved. (توسيع البحث)
solved. » solve. (توسيع البحث)
hard » had (توسيع البحث)
farm » form (توسيع البحث), far (توسيع البحث), firm (توسيع البحث)
removes. » remove. (توسيع البحث)
evolved. » resolved. (توسيع البحث)
solved. » solve. (توسيع البحث)
-
41
-
42
-
43
-
44
-
45
-
46
-
47
-
48
-
49
-
50
-
51
Are stacker crane problems easy?
منشور في 2013"…Several authors have noted that while ATSPs are NP-hard, some instances are readily solved to optimality in only a short amount of time. …"
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
article -
52
Statistical Modelling and Correlation of Membrane Distillation Data
منشور في 2014احصل على النص الكامل
doctoralThesis -
53
-
54
The lung protein that tells all
منشور في 2016"…Lung function is generally tested using a spirometer, which involves taking a very deep breath then exhaling forcefully into the device. …"
-
55
An easy-to-use scalable framework for parallel recursive backtracking
منشور في 2013"…The limiting factors of such algorithms are usually communication overhead and poor load balancing. Solving NP-hard graph problems to optimality using exact algorithms is an example of an area in which there has so far been limited success in obtaining large scale parallelism. …"
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
article -
56
-
57
On scalable parallel recursive backtracking
منشور في 2015"…The limiting factors of such algorithms are usually communication overhead and poor load balancing. Solving NP-hard graph problems to optimality using exact algorithms is an example of an area in which there has so far been limited success in obtaining large scale parallelism. …"
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
article -
58
-
59
Parallel scatter search algorithms for exam timetabling. (c2009)
منشور في 2009احصل على النص الكامل
احصل على النص الكامل
masterThesis -
60
On the complexity of multi-parameterized cluster editing
منشور في 2017"…We show that the problem remains -hard even when only one edge can be deleted and at most two edges can be added per vertex. …"
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
article