Gotowa bibliografia na temat „Global and local optimizations”
Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych
Spis treści
Zobacz listy aktualnych artykułów, książek, rozpraw, streszczeń i innych źródeł naukowych na temat „Global and local optimizations”.
Przycisk „Dodaj do bibliografii” jest dostępny obok każdej pracy w bibliografii. Użyj go – a my automatycznie utworzymy odniesienie bibliograficzne do wybranej pracy w stylu cytowania, którego potrzebujesz: APA, MLA, Harvard, Chicago, Vancouver itp.
Możesz również pobrać pełny tekst publikacji naukowej w formacie „.pdf” i przeczytać adnotację do pracy online, jeśli odpowiednie parametry są dostępne w metadanych.
Artykuły w czasopismach na temat "Global and local optimizations"
Ravi Kiran, B., i Jean Serra. "Global–local optimizations by hierarchical cuts and climbing energies". Pattern Recognition 47, nr 1 (styczeń 2014): 12–24. http://dx.doi.org/10.1016/j.patcog.2013.05.012.
Pełny tekst źródłaWang, Wei, Xiaoshan Zhang i Min Li. "A Filled Function Method Dominated by Filter for Nonlinearly Global Optimization". Journal of Applied Mathematics 2015 (2015): 1–8. http://dx.doi.org/10.1155/2015/245427.
Pełny tekst źródłaLi, Shuang, i Qiuwei Li. "Local and Global Convergence of General Burer-Monteiro Tensor Optimizations". Proceedings of the AAAI Conference on Artificial Intelligence 36, nr 9 (28.06.2022): 10266–74. http://dx.doi.org/10.1609/aaai.v36i9.21267.
Pełny tekst źródłaLazzaretto, Andrea, Andrea Toffolo, Matteo Morandin i Michael R. von Spakovsky. "Criteria for the decomposition of energy systems in local/global optimizations". Energy 35, nr 2 (luty 2010): 1157–63. http://dx.doi.org/10.1016/j.energy.2009.06.009.
Pełny tekst źródłaYang, Dezhi, Xintong He, Jun Wang, Guoxian Yu, Carlotta Domeniconi i Jinglin Zhang. "Federated Causality Learning with Explainable Adaptive Optimization". Proceedings of the AAAI Conference on Artificial Intelligence 38, nr 15 (24.03.2024): 16308–15. http://dx.doi.org/10.1609/aaai.v38i15.29566.
Pełny tekst źródłaZatolokin, Y. A., E. I. Vatutin i V. S. Titov. "ALGORITHMIC OPTIMIZATION OF SOFTWARE IMPLEMENTATION OF ALGORITHMS FOR MULTIPLYING DENSE REAL MATRICES ON GRAPHICS PROCESSORS WITH OPENGL TECHNOLOGY SUPPORT". Proceedings of the Southwest State University 21, nr 5 (28.10.2017): 6–15. http://dx.doi.org/10.21869/2223-1560-2017-21-5-06-15.
Pełny tekst źródłaBao, Rong, Yongdong Li, Hongguang Wang i Chunliang Liu. "A Multi-Constrained Optimization Method for THz Backward Wave Oscillators". Applied Sciences 12, nr 20 (20.10.2022): 10583. http://dx.doi.org/10.3390/app122010583.
Pełny tekst źródłaTohka, Jussi. "GLOBAL DEFORMABLE SURFACE OPTIMIZATION USING ADAPTIVE CONSTRAINTS AND PENALTIES". Image Analysis & Stereology 24, nr 1 (3.05.2011): 9. http://dx.doi.org/10.5566/ias.v24.p9-19.
Pełny tekst źródłaJia, Jia, i Dejun Mu. "Low-Energy-Orientated Resource Scheduling in Cloud Computing by Particle Swarm Optimization". Xibei Gongye Daxue Xuebao/Journal of Northwestern Polytechnical University 36, nr 2 (kwiecień 2018): 339–44. http://dx.doi.org/10.1051/jnwpu/20183620339.
Pełny tekst źródłaGrunbacher, Sophie, Ramin Hasani, Mathias Lechner, Jacek Cyranka, Scott A. Smolka i Radu Grosu. "On the Verification of Neural ODEs with Stochastic Guarantees". Proceedings of the AAAI Conference on Artificial Intelligence 35, nr 13 (18.05.2021): 11525–35. http://dx.doi.org/10.1609/aaai.v35i13.17372.
Pełny tekst źródłaRozprawy doktorskie na temat "Global and local optimizations"
Ding, Baoyan. "A parametric solution for local and global optimization". Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1997. http://www.collectionscanada.ca/obj/s4/f2/dsk3/ftp04/nq21341.pdf.
Pełny tekst źródłaShiao, Cheng-Mu. "Resolution of kinematic redundancy through local and global optimization /". The Ohio State University, 1988. http://rave.ohiolink.edu/etdc/view?acc_num=osu1487597424137831.
Pełny tekst źródłaWang, Le Yi. "Normed double algebras, local and global optimization, and slow H00 adaptation". Thesis, McGill University, 1989. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=74258.
Pełny tekst źródłaAn explicit double algebraic expression for adaptive BIBO sensitivity reduction is established. Notions of adaptive and robust (non-adaptive) sensitivity minimization are applied to an example involving rejection of narrowband disturbances of uncertain bandwidth and center frequency. The double algebra symbolism is employed to show that adaptive minimization can give better sensitivity than $H sp infty$ optimal robust minimization.
To implement a design strategy of global sensitivity optimization using local $H sp infty$ interpolation, Lipschitz continuity of optimal $H sp infty$ interpolants on data is investigated. While optimal $H sp infty$ interpolants in general do not depend Lipschitz continuously on data, $ delta$-suboptimal interpolants based on AAK's maximal entropy solutions satisfy an appropriate Lipschitz continuity condition. These, applied to slowly time-varying systems, achieve approximations to the globally optimal interpolants, which become accurate as the rates of variation approach zero.
Ragon, Scott Alan II. "Development of a Global/Local Approach and a Geometrically Non-linear Local Panel Analysis for Structural Design". Diss., Virginia Tech, 1998. http://hdl.handle.net/10919/30761.
Pełny tekst źródłaPh. D.
Huynh, Vu Anh. "Combining local and global optimization for planning and control in information space". Thesis, Massachusetts Institute of Technology, 2008. http://hdl.handle.net/1721.1/45281.
Pełny tekst źródłaIncludes bibliographical references (leaves 99-102).
This thesis presents a novel algorithm, called the parametric optimized belief roadmap (POBRM), to address the problem of planning a trajectory for controlling a robot with imperfect state information under uncertainty. This question is formulated abstractly as a partially observable stochastic shortest path (POSSP) problem. We assume that the feature-based map of a region is available to assist the robot's decision-making. The POBRM is a two-phase algorithm that combines local and global optimization. In an offline phase, we construct a belief graph by probabilistically sampling points around the features that potentially provide the robot with valuable information. Each edge of the belief graph stores two transfer functions to predict the cost and the conditional covariance matrix of a final state estimate if the robot follows this edge given an initial mean and covariance. In an online phase, a sub-optimal trajectory is found by the global Dijkstra's search algorithm, which ensures the balance between exploration and exploitation. Moreover, we use the iterative linear quadratic Gaussian algorithm (iLQG) to find a locally-feedback control policy in continuous state and control spaces to traverse the sub-optimal trajectory. We show that, under some suitable technical assumptions, the error bound of a sub-optimal cost compared to the globally optimal cost can be obtained. The POBRM algorithm is not only robust to imperfect state information but also scalable to find a trajectory quickly in high-dimensional systems and environments. In addition, the POBRM algorithm is capable of answering multiple queries efficiently. We also demonstrate performance results by 2D simulation of a planar car and 3D simulation of an autonomous helicopter.
by Vu Anh Huynh.
S.M.
Gogolashvili, Davit. "Global and local Kernel methods for dataset shift, scalable inference and optimization". Electronic Thesis or Diss., Sorbonne université, 2022. https://accesdistant.sorbonne-universite.fr/login?url=https://theses-intra.sorbonne-universite.fr/2022SORUS363v2.pdf.
Pełny tekst źródłaIn many real world problems, the training data and test data have different distributions. The most common settings for dataset shift often considered in the literature are covariate shift and target shift. In this thesis, we investigate nonparametric models applied to the dataset shift scenario. We develop a novel framework to accelerate Gaussian process regression. In particular, we consider localization kernels at each data point to down-weigh the contributions from other data points that are far away, and we derive the GPR model stemming from the application of such localization operation. We propose a new method for estimating the minimizer and the minimum value of a smooth and strongly convex regression function from the observations contaminated by random noise
Steffens, Michael J. "A combined global and local methodology for launch vehicle trajectory design-space exploration and optimization". Thesis, Georgia Institute of Technology, 2014. http://hdl.handle.net/1853/51884.
Pełny tekst źródłaPaudel, Danda Pani. "Local and global methods for registering 2D image sets and 3D point clouds". Thesis, Dijon, 2015. http://www.theses.fr/2015DIJOS077/document.
Pełny tekst źródłaIn this thesis, we study the problem of registering 2D image sets and 3D point clouds under threedifferent acquisition set-ups. The first set-up assumes that the image sets are captured using 2Dcameras that are fully calibrated and coupled, or rigidly attached, with a 3D sensor. In this context,the point cloud from the 3D sensor is registered directly to the asynchronously acquired 2D images.In the second set-up, the 2D cameras are internally calibrated but uncoupled from the 3D sensor,allowing them to move independently with respect to each other. The registration for this set-up isperformed using a Structure-from-Motion reconstruction emanating from images and planar patchesrepresenting the point cloud. The proposed registration method is globally optimal and robust tooutliers. It is based on the theory Sum-of-Squares polynomials and a Branch-and-Bound algorithm.The third set-up consists of uncoupled and uncalibrated 2D cameras. The image sets from thesecameras are registered to the point cloud in a globally optimal manner using a Branch-and-Prunealgorithm. Our method is based on a Linear Matrix Inequality framework that establishes directrelationships between 2D image measurements and 3D scene voxels
Cafieri, Sonia. "From local to global and back : a closed walk in mathematical programming and its applications". Habilitation à diriger des recherches, Université Paul Sabatier - Toulouse III, 2012. http://tel.archives-ouvertes.fr/tel-00979273.
Pełny tekst źródłaSeresta, Omprakash. "Buckling, Flutter, and Postbuckling Optimization of Composite Structures". Diss., Virginia Tech, 2007. http://hdl.handle.net/10919/26401.
Pełny tekst źródłaPh. D.
Książki na temat "Global and local optimizations"
Migdalas, Athanasios, Panos M. Pardalos i Peter Värbrand, red. From Local to Global Optimization. Boston, MA: Springer US, 2001. http://dx.doi.org/10.1007/978-1-4757-5284-7.
Pełny tekst źródłaAthanasios, Migdalas, Pardalos P. M. 1954- i Värbrand Peter, red. From local to global optimization. Dordrecht: Kluwer Academic, 2001.
Znajdź pełny tekst źródłaM, Pardalos Panos, i Värbrand Peter, red. From Local to Global Optimization. Boston, MA: Springer US, 2001.
Znajdź pełny tekst źródłaAthanasios, Migdalas, Pardalos P. M. 1954- i Värbrand Peter, red. From local to global optimization. Dordrecht: Kluwer Academic, 2001.
Znajdź pełny tekst źródłaFloudas, Christodoulos A., Pãnos M. Pardalos, Claire S. Adjiman, William R. Esposito, Zeynep H. Gümüş, Stephen T. Harding, John L. Klepeis, Clifford A. Meyer i Carl A. Schweiger. Handbook of Test Problems in Local and Global Optimization. Boston, MA: Springer US, 1999. http://dx.doi.org/10.1007/978-1-4757-3040-1.
Pełny tekst źródłaFloudas, Christodoulos A. Handbook of Test Problems in Local and Global Optimization. Boston, MA: Springer US, 1999.
Znajdź pełny tekst źródłaA, Floudas Christodoulos, red. Handbook of test problems in local and global optimization. Dordrecht: Kluwer Academic Publishers, 1999.
Znajdź pełny tekst źródłaA, Floudas Christodoulos, i Pardalos P. M. 1954-, red. Optimization in computational chemistry and molecular biology: Local and global approaches. Dordrecht: Kluwer Academic Publishers, 2000.
Znajdź pełny tekst źródłaMirando, Wander Melo. Local/global. São Paulo: Fundaço Memorial de América Latina, 1998.
Znajdź pełny tekst źródłaBerman, Ila. URBANbuild: Local global. Richmond, CA: William Stout Publishers, 2008.
Znajdź pełny tekst źródłaCzęści książek na temat "Global and local optimizations"
Schäffler, Stefan. "Unconstrained Local Optimization". W Global Optimization, 7–19. New York, NY: Springer New York, 2012. http://dx.doi.org/10.1007/978-1-4614-3927-1_2.
Pełny tekst źródłaSvanberg, K. "Local and Global Optima". W Optimization of Large Structural Systems, 579–88. Dordrecht: Springer Netherlands, 1993. http://dx.doi.org/10.1007/978-94-010-9577-8_28.
Pełny tekst źródłaDu, Ding-Zhu, Panos M. Pardalos i Weili Wu. "From Local to Global". W Nonconvex Optimization and Its Applications, 227–43. Boston, MA: Springer US, 2001. http://dx.doi.org/10.1007/978-1-4757-5795-8_15.
Pełny tekst źródłaEl-Shorbagy, M. A., i Aboul Ella Hassanien. "Spherical Local Search for Global Optimization". W Advances in Intelligent Systems and Computing, 304–12. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-99010-1_28.
Pełny tekst źródłaKrzeszowski, Tomasz, Bogdan Kwolek i Konrad Wojciechowski. "Model-Based 3D Human Motion Capture Using Global-Local Particle Swarm Optimizations". W Computer Recognition Systems 4, 297–306. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-20320-6_31.
Pełny tekst źródłaNareyek, Alexander. "Using global constraints for local search". W Constraint Programming and Large Scale Discrete Optimization, 9–28. Providence, Rhode Island: American Mathematical Society, 2001. http://dx.doi.org/10.1090/dimacs/057/02.
Pełny tekst źródłaBolton, Hermanus P. J., Jaco F. Schutte i Albert A. Groenwold. "Multiple Parallel Local Searches in Global Optimization". W Recent Advances in Parallel Virtual Machine and Message Passing Interface, 88–95. Berlin, Heidelberg: Springer Berlin Heidelberg, 2000. http://dx.doi.org/10.1007/3-540-45255-9_15.
Pełny tekst źródłaBagirov, A. M., N. Sultanova, A. Al Nuaimat i S. Taheri. "Solving Minimax Problems: Local Smoothing Versus Global Smoothing". W Numerical Analysis and Optimization, 23–43. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-90026-1_2.
Pełny tekst źródłaHamma, Beidi Soumana. "Local and Global Behavior of Moving Polytope Algorithms". W Nonconvex Optimization and Its Applications, 305–25. Boston, MA: Springer US, 2001. http://dx.doi.org/10.1007/978-1-4757-5284-7_14.
Pełny tekst źródłaHendrix, Eligius M. T., i Ana Maria A. C. Rocha. "On Local Convergence of Stochastic Global Optimization Algorithms". W Computational Science and Its Applications – ICCSA 2021, 456–72. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-86976-2_31.
Pełny tekst źródłaStreszczenia konferencji na temat "Global and local optimizations"
Renaud, J. E., i G. A. Gabriele. "Sequential Global Approximation in Non-Hierarchic System Decomposition and Optimization". W ASME 1991 Design Technical Conferences. American Society of Mechanical Engineers, 1991. http://dx.doi.org/10.1115/detc1991-0086.
Pełny tekst źródłaZhou Wu, Lu Xu, Tommy W. S. Chow i Mingbo Zhao. "Local cooperation delivers global optimization". W 2012 IEEE Congress on Evolutionary Computation (CEC). IEEE, 2012. http://dx.doi.org/10.1109/cec.2012.6256548.
Pełny tekst źródłaAlam, Mohammad Shafiul, Md Ashiqur Rahman i Md Monirul Islam. "A new framework for balancing both local and global optimizations in evolutionary algorithms". W 2007 10th International Conference on Computer and Information Technology (ICCIT 2007). IEEE, 2007. http://dx.doi.org/10.1109/iccitechn.2007.4579358.
Pełny tekst źródłaXun Wang, Chang-Dong Wang i Jian-Huang Lai. "Modularity optimization by Global-Local Search". W 2016 International Joint Conference on Neural Networks (IJCNN). IEEE, 2016. http://dx.doi.org/10.1109/ijcnn.2016.7727287.
Pełny tekst źródłaLiu, Qiang, Sameer B. Mulani i Rakesh K. Kapania. "Global/Local Multidisciplinary Design Optimization of Subsonic Wing". W 10th AIAA Multidisciplinary Design Optimization Conference. Reston, Virginia: American Institute of Aeronautics and Astronautics, 2014. http://dx.doi.org/10.2514/6.2014-0471.
Pełny tekst źródłaKuszmaul, Christopher L. "FFT communications requirement optimizations on massively parallel architectures with local and global interprocessor communications capabilities". W San Diego '90, 8-13 July, redaktor Franklin T. Luk. SPIE, 1990. http://dx.doi.org/10.1117/12.23497.
Pełny tekst źródłaLancinskas, Algirdas, Julius Zilinskas i Pilar Martinez Ortigosa. "Local optimization in global Multi-Objective Optimization Algorithms". W 2011 Third World Congress on Nature and Biologically Inspired Computing (NaBIC). IEEE, 2011. http://dx.doi.org/10.1109/nabic.2011.6089613.
Pełny tekst źródłaGhommem, Mehdi, Muhammad Hajj, Bret Stanford, Layne Watson i Philip Beran. "Global and Local Optimization of Flapping Kinematics". W 53rd AIAA/ASME/ASCE/AHS/ASC Structures, Structural Dynamics and Materials Conference
20th AIAA/ASME/AHS Adaptive Structures Conference
14th AIAA. Reston, Virigina: American Institute of Aeronautics and Astronautics, 2012. http://dx.doi.org/10.2514/6.2012-1983.
Ding, Quanxin, i Hua Liu. "Development in local and global optimization methods". W Photonics Asia 2007, redaktorzy Yongtian Wang, Theo T. Tschudi, Jannick P. Rolland i Kimio Tatsuno. SPIE, 2007. http://dx.doi.org/10.1117/12.756511.
Pełny tekst źródłaMengistu, Temesgen, Wahid Ghaly i Tarek Mansour. "Global- and Local-Shape Aerodynamic Optimization of Turbine Blades". W 11th AIAA/ISSMO Multidisciplinary Analysis and Optimization Conference. Reston, Virigina: American Institute of Aeronautics and Astronautics, 2006. http://dx.doi.org/10.2514/6.2006-6933.
Pełny tekst źródłaRaporty organizacyjne na temat "Global and local optimizations"
Haftka, Raphael T. Theory and Algorithms for Global/Local Design Optimization. Fort Belvoir, VA: Defense Technical Information Center, grudzień 2004. http://dx.doi.org/10.21236/ada437353.
Pełny tekst źródłaGurdal, Zafer, Scott Ragon i Douglas Lindner. Global/Local Design Optimization of a Power Distribution System. Fort Belvoir, VA: Defense Technical Information Center, wrzesień 2000. http://dx.doi.org/10.21236/ada387344.
Pełny tekst źródłaGurdal, Zafer, Scott Ragon i Douglas Lindner. Global/Local Design Optimization of A Power Distribution System. Fort Belvoir, VA: Defense Technical Information Center, marzec 2000. http://dx.doi.org/10.21236/ada389411.
Pełny tekst źródłaLindner, Douglas K. Energy Based Topology Optimization of Morphing Wings a Multidisciplinary Global/Local Design Approach. Fort Belvoir, VA: Defense Technical Information Center, grudzień 2006. http://dx.doi.org/10.21236/ada480198.
Pełny tekst źródłaAceves, S., V. Sahai i W. Stein. Explanation of how to run the global local optimization code (GLO) to find surface heat flux. Office of Scientific and Technical Information (OSTI), marzec 1999. http://dx.doi.org/10.2172/8214.
Pełny tekst źródłaChuang, Feng-Chuan. Global structual optimizations of surface systems with a genetic algorithm. Office of Scientific and Technical Information (OSTI), styczeń 2005. http://dx.doi.org/10.2172/850036.
Pełny tekst źródłaCooper, Leon N. Local and Global Factors in Learning. Fort Belvoir, VA: Defense Technical Information Center, listopad 1985. http://dx.doi.org/10.21236/ada161128.
Pełny tekst źródłaSánchez Gassen, Nora, Oskar Penje i Elin Slätmo. Global goals for local priorities: The 2030 Agenda at local level. Nordregio, wrzesień 2018. http://dx.doi.org/10.30689/r2018:2.1403-2503.
Pełny tekst źródłaChandrasekhar, Arun, Melanie Morten i Alessandra Peter. Network-Based Hiring: Local Benefits; Global Costs. Cambridge, MA: National Bureau of Economic Research, luty 2020. http://dx.doi.org/10.3386/w26806.
Pełny tekst źródłaDurlauf, Steven, i Paul Johnson. Local Versus Global Convergence Across National Economies. Cambridge, MA: National Bureau of Economic Research, luty 1992. http://dx.doi.org/10.3386/w3996.
Pełny tekst źródła