Articles liés à Latin Hypercube Designs: Complexity Analysis of Iterated...
Latin Hypercube Designs: Complexity Analysis of Iterated Local Search Algorithm in Experimental Domain for Optimizing Latin Hypercube Designs - Couverture souple
Synopsis
Computer experiments involve a large numbers of variables, but only a few of them have no negligible influence on the response. Unfortunately, randomly generated Latin Hypercube Designs (LHDs) almost always show poor space-filling properties. When numbers of factors as well as number of experimental points are large, the heuristic approaches also require a couple of hours or even more to find out a simulated optimal design. Specially for the need of real time solution, the time complexity of the ILS approaches is analyzed. After analyzing, the time complexity model of the algorithms for two optimal criterion namely Opt (D1, J1) as well as Opt(Φ) has been developed. More over some experiments have been performed for higher dimension namely dimensions k >10. Some new maximin LHDs value are obtained from these experiments, as there are few maximin LHDs value available in the literatures for higher dimension, k >10. From these experiments, multi-collinearity property, maximin LHDs in Rectangular distance, mimimal Φ values, maximum pair-wise distance value of LHDs etc. are represented in this book.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
Résultats de recherche pour Latin Hypercube Designs: Complexity Analysis of Iterated...
Image fournie par le vendeur
Latin Hypercube Designs
Edité par
LAP LAMBERT Academic Publishing Jan 2021, 2021
ISBN 10 : 6203307572
ISBN 13 : 9786203307573
Neuf
Taschenbuch
Vendeur : BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Taschenbuch. Etat : Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -Computer experiments involve a large numbers of variables, but only a few of them have no negligible influence on the response. Unfortunately, randomly generated Latin Hypercube Designs (LHDs) almost always show poor space-filling properties. When numbers of factors as well as number of experimental points are large, the heuristic approaches also require a couple of hours or even more to find out a simulated optimal design. Specially for the need of real time solution, the time complexity of the ILS approaches is analyzed. After analyzing, the time complexity model of the algorithms for two optimal criterion namely Opt (D1, J1) as well as Opt( ) has been developed. More over some experiments have been performed for higher dimension namely dimensions k >10. Some new maximin LHDs value are obtained from these experiments, as there are few maximin LHDs value available in the literatures for higher dimension, k >10. From these experiments, multi-collinearity property, maximin LHDs in Rectangular distance, mimimal values, maximum pair-wise distance value of LHDs etc. are represented in this book. 88 pp. Englisch. N° de réf. du vendeur 9786203307573
Acheter neuf
EUR 39,90
Expédition à EUR 23
Expédition depuis Allemagne vers Etats-Unis
Expédition depuis Allemagne vers Etats-Unis
Quantité disponible : 2 disponible(s)
Image fournie par le vendeur
Latin Hypercube Designs : Complexity Analysis of Iterated Local Search Algorithm in Experimental Domain for Optimizing Latin Hypercube Designs
Edité par
LAP LAMBERT Academic Publishing, 2021
ISBN 10 : 6203307572
ISBN 13 : 9786203307573
Neuf
Taschenbuch
Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Taschenbuch. Etat : Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - Computer experiments involve a large numbers of variables, but only a few of them have no negligible influence on the response. Unfortunately, randomly generated Latin Hypercube Designs (LHDs) almost always show poor space-filling properties. When numbers of factors as well as number of experimental points are large, the heuristic approaches also require a couple of hours or even more to find out a simulated optimal design. Specially for the need of real time solution, the time complexity of the ILS approaches is analyzed. After analyzing, the time complexity model of the algorithms for two optimal criterion namely Opt (D1, J1) as well as Opt( ) has been developed. More over some experiments have been performed for higher dimension namely dimensions k >10. Some new maximin LHDs value are obtained from these experiments, as there are few maximin LHDs value available in the literatures for higher dimension, k >10. From these experiments, multi-collinearity property, maximin LHDs in Rectangular distance, mimimal values, maximum pair-wise distance value of LHDs etc. are represented in this book. N° de réf. du vendeur 9786203307573
Acheter neuf
EUR 45,66
Expédition à EUR 35
Expédition depuis Allemagne vers Etats-Unis
Expédition depuis Allemagne vers Etats-Unis
Quantité disponible : 1 disponible(s)
Image fournie par le vendeur
Latin Hypercube Designs
Edité par
LAP LAMBERT Academic Publishing Jan 2021, 2021
ISBN 10 : 6203307572
ISBN 13 : 9786203307573
Neuf
Taschenbuch
Vendeur : buchversandmimpf2000, Emtmannsberg, BAYE, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Taschenbuch. Etat : Neu. This item is printed on demand - Print on Demand Titel. Neuware -Computer experiments involve a large numbers of variables, but only a few of them have no negligible influence on the response. Unfortunately, randomly generated Latin Hypercube Designs (LHDs) almost always show poor space-filling properties. When numbers of factors as well as number of experimental points are large, the heuristic approaches also require a couple of hours or even more to find out a simulated optimal design. Specially for the need of real time solution, the time complexity of the ILS approaches is analyzed. After analyzing, the time complexity model of the algorithms for two optimal criterion namely Opt (D1, J1) as well as Opt(¿) has been developed. More over some experiments have been performed for higher dimension namely dimensions k >10. Some new maximin LHDs value are obtained from these experiments, as there are few maximin LHDs value available in the literatures for higher dimension, k >10. From these experiments, multi-collinearity property, maximin LHDs in Rectangular distance, mimimal ¿ values, maximum pair-wise distance value of LHDs etc. are represented in this book.VDM Verlag, Dudweiler Landstraße 99, 66123 Saarbrücken 88 pp. Englisch. N° de réf. du vendeur 9786203307573
Acheter neuf
EUR 39,90
Expédition à EUR 60
Expédition depuis Allemagne vers Etats-Unis
Expédition depuis Allemagne vers Etats-Unis
Quantité disponible : 1 disponible(s)
Image fournie par le vendeur
Latin Hypercube Designs | Complexity Analysis of Iterated Local Search Algorithm in Experimental Domain for Optimizing Latin Hypercube Designs
Edité par
LAP LAMBERT Academic Publishing, 2021
ISBN 10 : 6203307572
ISBN 13 : 9786203307573
Neuf
Taschenbuch
Vendeur : preigu, Osnabrück, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Taschenbuch. Etat : Neu. Latin Hypercube Designs | Complexity Analysis of Iterated Local Search Algorithm in Experimental Domain for Optimizing Latin Hypercube Designs | Parimal Mridha | Taschenbuch | Englisch | 2021 | LAP LAMBERT Academic Publishing | EAN 9786203307573 | Verantwortliche Person für die EU: preigu GmbH & Co. KG, Lengericher Landstr. 19, 49078 Osnabrück, mail[at]preigu[dot]de | Anbieter: preigu. N° de réf. du vendeur 119695698
Acheter neuf
EUR 36,35
Expédition à EUR 70
Expédition depuis Allemagne vers Etats-Unis
Expédition depuis Allemagne vers Etats-Unis
Quantité disponible : 5 disponible(s)