Articoli correlati a 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 - Brossura
Sinossi
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.
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
Risultati della ricerca per Latin Hypercube Designs: Complexity Analysis of Iterated...
Immagini fornite dal venditore
Latin Hypercube Designs
Editore:
LAP LAMBERT Academic Publishing Jan 2021, 2021
ISBN 10: 6203307572
ISBN 13: 9786203307573
Nuovo
Taschenbuch
Da: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germania
Valutazione del venditore 5 su 5 stelle
Taschenbuch. Condizione: 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. Codice articolo 9786203307573
Compra nuovo
EUR 39,90
Spedizione EUR 23,00
Spedito da Germania a U.S.A.
Spedito da Germania a U.S.A.
Quantità: 2 disponibili
Immagini fornite dal venditore
Latin Hypercube Designs : Complexity Analysis of Iterated Local Search Algorithm in Experimental Domain for Optimizing Latin Hypercube Designs
Editore:
LAP LAMBERT Academic Publishing, 2021
ISBN 10: 6203307572
ISBN 13: 9786203307573
Nuovo
Taschenbuch
Da: AHA-BUCH GmbH, Einbeck, Germania
Valutazione del venditore 5 su 5 stelle
Taschenbuch. Condizione: 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. Codice articolo 9786203307573
Compra nuovo
EUR 45,66
Spedizione EUR 35,00
Spedito da Germania a U.S.A.
Spedito da Germania a U.S.A.
Quantità: 1 disponibili
Immagini fornite dal venditore
Latin Hypercube Designs
Editore:
LAP LAMBERT Academic Publishing Jan 2021, 2021
ISBN 10: 6203307572
ISBN 13: 9786203307573
Nuovo
Taschenbuch
Da: buchversandmimpf2000, Emtmannsberg, BAYE, Germania
Valutazione del venditore 5 su 5 stelle
Taschenbuch. Condizione: 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. Codice articolo 9786203307573
Compra nuovo
EUR 39,90
Spedizione EUR 60,00
Spedito da Germania a U.S.A.
Spedito da Germania a U.S.A.
Quantità: 1 disponibili
Immagini fornite dal venditore
Latin Hypercube Designs | Complexity Analysis of Iterated Local Search Algorithm in Experimental Domain for Optimizing Latin Hypercube Designs
Editore:
LAP LAMBERT Academic Publishing, 2021
ISBN 10: 6203307572
ISBN 13: 9786203307573
Nuovo
Taschenbuch
Da: preigu, Osnabrück, Germania
Valutazione del venditore 5 su 5 stelle
Taschenbuch. Condizione: 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. Codice articolo 119695698
Compra nuovo
EUR 36,35
Spedizione EUR 70,00
Spedito da Germania a U.S.A.
Spedito da Germania a U.S.A.
Quantità: 5 disponibili