Zobrazeno 1 - 10
of 234
pro vyhledávání: '"C Patvardhan"'
Publikováno v:
Scientific Reports, Vol 14, Iss 1, Pp 1-17 (2024)
Abstract In the fast-paced fashion world, unique designs are like early birds, grabbing attention as online shopping surges. Fabric texture plays an immense role in selecting the perfect design. Indian Traditional textile motifs are pivotal, showing
Externí odkaz:
https://doaj.org/article/abd928b7a1c446f7b98b9de2e896d396
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
2023 6th International Conference on Information Systems and Computer Networks (ISCON).
Publikováno v:
2023 6th International Conference on Information Systems and Computer Networks (ISCON).
Publikováno v:
Lecture Notes in Electrical Engineering ISBN: 9789811958670
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7290dc3c4e1f83a4625cb183db5333f1
https://doi.org/10.1007/978-981-19-5868-7_28
https://doi.org/10.1007/978-981-19-5868-7_28
Publikováno v:
Lecture Notes in Electrical Engineering ISBN: 9789819900466
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::08d9e58755fd01e7e6aed27b49f40b57
https://doi.org/10.1007/978-981-99-0047-3_59
https://doi.org/10.1007/978-981-99-0047-3_59
Publikováno v:
Engineering Applications of Artificial Intelligence. 119:105734
Publikováno v:
International Journal of Industrial Engineering Computations, Vol 3, Iss 2, Pp 145-158 (2012)
A central problem of tool management in Versatile Multi-tool machining centres is to decide how to batch the parts to be produced and what tools to allocate to the machine in order to maximize utilization of these expensive machines. Various authors
Externí odkaz:
https://doaj.org/article/fc1a5a2e0b4c44fc9ef9581c37fdc4d1
Autor:
Sulabh Bansal, C. Patvardhan
Publikováno v:
International Journal of Applied Evolutionary Computation. 10:1-38
Quantum-inspired evolutionary algorithms (QIEAs) like all evolutionary algorithms (EAs) perform well on many problems but cannot perform equally better than random for all problems due to the No Free Lunch theorem. However, a framework providing near
Autor:
Sulabh Bansal, C. Patvardhan
This article describes how the 0/1 Multiple Knapsack Problem (MKP), a generalization of popular 0/1 Knapsack Problem, is NP-hard and harder than simple Knapsack Problem. Solution of MKP involves two levels of choice – one for selecting an item to b
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::daf5364d74c8ca2de5df9bca0b6ce3a7
https://doi.org/10.4018/978-1-7998-8593-1.ch002
https://doi.org/10.4018/978-1-7998-8593-1.ch002