Literatura científica selecionada sobre o tema "Optimisation de boîte noire"
Crie uma referência precisa em APA, MLA, Chicago, Harvard, e outros estilos
Consulte a lista de atuais artigos, livros, teses, anais de congressos e outras fontes científicas relevantes para o tema "Optimisation de boîte noire".
Ao lado de cada fonte na lista de referências, há um botão "Adicionar à bibliografia". Clique e geraremos automaticamente a citação bibliográfica do trabalho escolhido no estilo de citação de que você precisa: APA, MLA, Harvard, Chicago, Vancouver, etc.
Você também pode baixar o texto completo da publicação científica em formato .pdf e ler o resumo do trabalho online se estiver presente nos metadados.
Artigos de revistas sobre o assunto "Optimisation de boîte noire"
Vachon, Georges-André. "La boîte noire". Études françaises 31, n.º 2 (1995): 177. http://dx.doi.org/10.7202/035991ar.
Texto completo da fonteRelieu, Marc. "Ouvrir la boîte noire". Réseaux 112-113, n.º 2 (2002): 20. http://dx.doi.org/10.3917/res.112.0020.
Texto completo da fonteGuerrien, Bernard. "L'entreprise, une boîte noire". Alternatives Économiques 237, n.º 6 (1 de junho de 2005): 76. http://dx.doi.org/10.3917/ae.237.0076.
Texto completo da fonteAutès, Michel. "Ouvrir la boîte noire". Recherches et Prévisions 38, n.º 1 (1994): 63–68. http://dx.doi.org/10.3406/caf.1994.1663.
Texto completo da fonteRichaudeau, François. "Éclaircies dans une boîte noire". Communication et langages 90, n.º 1 (1991): 121. http://dx.doi.org/10.3406/colan.1991.2345.
Texto completo da fonteCameron, Bobby Thomas Robert. "Discursive Black and Translucent Box Frames of Policy Work: How do Practitioners and Scholars Compare?" Canadian Political Science Review 15, n.º 1 (1 de abril de 2022): 44–56. http://dx.doi.org/10.24124/c677/20211829.
Texto completo da fonteMichel, Dominique-Anne. "Dans la boîte noire de l'entrepreneuriat". L'Expansion Management Review N° 155, n.º 4 (2014): 3. http://dx.doi.org/10.3917/emr.155.0003.
Texto completo da fonteSmadja, David. "La boîte noire de la controverse". Raisons politiques 47, n.º 3 (2012): 5. http://dx.doi.org/10.3917/rai.047.0005.
Texto completo da fonteMondémé, Chloé. "La boîte noire de l’intentionnalité animale". Zilsel N°7, n.º 2 (2020): 199. http://dx.doi.org/10.3917/zil.007.0199.
Texto completo da fonteLecomte-Finiger, Raymonde. "L'otolithe: la ≪ boîte noire ≫ des Téléostéens". L’Année Biologique 38, n.º 2 (abril de 1999): 107–22. http://dx.doi.org/10.1016/s0003-5017(99)80029-4.
Texto completo da fonteTeses / dissertações sobre o assunto "Optimisation de boîte noire"
Ros, Raymond. "Optimisation Continue Boîte Noire : Comparaison et Conception d'Algorithmes". Phd thesis, Université Paris Sud - Paris XI, 2009. http://tel.archives-ouvertes.fr/tel-00595922.
Texto completo da fonteIrfan, Muhammad Naeem. "Analyse et optimisation d'algorithmes pour l'inférence de modèles de composants logiciels". Phd thesis, Université de Grenoble, 2012. http://tel.archives-ouvertes.fr/tel-00767894.
Texto completo da fonteVarelas, Konstantinos. "Randomized Derivative Free Optimization via CMA-ES and Sparse Techniques : Applications to Radars". Thesis, Institut polytechnique de Paris, 2021. http://www.theses.fr/2021IPPAX012.
Texto completo da fonteIn this thesis, we investigate aspects of adaptive randomized methods for black-box continuous optimization. The algorithms that we study are based on the Covariance Matrix Adaptation Evolution Strategy (CMA-ES) algorithm and focus on large scale optimization problems.We start with a description of CMA-ES and its relation to the Information Geometric Optimization (IGO) framework, succeeded by a comparative study of large scale variants of CMA-ES. We furthermore propose novel methods which integrate tools of high dimensional analysis within CMA-ES, to obtain more efficient algorithms for large scale partially separable problems.Additionally, we describe the methodology for algorithm performance evaluation adopted by the Comparing Continuous Optimizers (COCO) platform, and finalize the bbob-largescale test suite, a novel benchmarking suite with problems of increased dimensions and with a low computational cost.Finally, we present the formulation, methodology and obtained results for two applications related to Radar problems, the Phase Code optimization problem and the Phased-Array Pattern design problem
Nguyen, Xuan-Nam. "Une approche « boite noire » pour résoudre le problème de placement des règles dans un réseau OpenFlow". Thesis, Nice, 2016. http://www.theses.fr/2016NICE4012/document.
Texto completo da fonteThe massive number of connected devices combined with an increasing traffic push network operators to their limit by limiting their profitability. To tackle this problem, Software-Defined Networking (SDN), which decouples network control logic from forwarding devices, has been proposed. An important part of the SDN concepts is implemented by the OpenFlow protocol that abstracts network communications as flows and processes them using a prioritized list of rules on the network forwarding elements. While the abstraction offered by OpenFlow allows to implement many applications, it raises the new problem of how to define the rules and where to place them in the network while respecting all requirements, which we refer as the OpenFlow Rules Placement Problem (ORPP). In this thesis, we focus on the ORPP and hide the complexity of network management by proposing a black box abstraction. First, we formalize that problem, classify and discuss existing solutions. We discover that most of the solutions enforce the routing policy when placing rules, which is not memory efficient in some cases. Second, by trading routing for better resource efficiency, we propose OFFICER and aOFFICER, two frameworks that select OpenFlow rules satisfying policies and network constraints, while minimizing overheads. The main idea of OFFICER an aOFFICER is to give high priority for large flows to be installed on efficient paths, and let other flows follow default paths. These proposals are evaluated and compared to existing solutions in realistic scenarios. Finally, we study a use case of the black box abstraction, in which we improve the performance of content delivery services in cellular networks
Berthier, Vincent. "Studies on Stochastic Optimisation and applications to the Real-World". Thesis, Université Paris-Saclay (ComUE), 2017. http://www.theses.fr/2017SACLS336/document.
Texto completo da fonteA lot of research is being done on Stochastic Optimisation in general and Genetic Algorithms in particular. Most of the new developments are then tested on well know testbeds like BBOB, CEC, etc. conceived to exhibit as many pitfalls as possible such as non-separability, multi-modality, valleys with an almost null gradient and so on. Most studies done on such testbeds are pretty straightforward, optimising a given number of variables for there cognized criterion on the testbed. The first contribution made here is to study the impact of some changes in those assumptions, namely the effect of supernumerary variables that don't change anything to a function evaluation on the one hand, and the effect of a change of the studied criterion on the other hand. A second contribution is in the modification of the mutation design for the algorithm CMA-ES, where we will use Quasi-Random mutations instead of purely random ones. This will almost always result in a very clear improvement ofthe observed results. This research also introduces the Sieves Method well known in statistics, to stochastic optimisers: by first optimising a small subset of the variables and gradually increasing the number of variables during the optimization process, we observe on some problems a very clear improvement. While artificial testbeds are of course really useful, they can only be the first step: in almost every case, the testbeds are a collection of purely mathematical functions, from the simplest one like the sphere, to some really complex functions. The goal of the design of new optimisers or the improvement of an existing one is however, in fine, to answer some real world question. It can be the design of a more efficient engine, finding the correct parameters of a physical model or even to organize data in clusters. Stochastic optimisers are used on those problems, in research or industry, but in most instances, an optimiser ischosen almost arbitrarily. We know how optimisers compare on artificial functions, but almost nothing is known abouttheir performances on real world problems. One of the main aspect of the research exposed here will be to compare someof the most used optimisers in the literature on problems inspired or directly coming from the real-world. On those problems, we will additionally test the efficiency of quasi-random mutations in CMA-ES and the Sieves-Method
Jankovic, Anja. "Towards Online Landscape-Aware Algorithm Selection in Numerical Black-Box Optimization". Electronic Thesis or Diss., Sorbonne université, 2021. http://www.theses.fr/2021SORUS302.
Texto completo da fonteBlack-box optimization algorithms (BBOAs) are conceived for settings in which exact problem formulations are non-existent, inaccessible, or too complex for an analytical solution. BBOAs are essentially the only means of finding a good solution to such problems. Due to their general applicability, BBOAs can exhibit different behaviors when optimizing different types of problems. This yields a meta-optimization problem of choosing the best suited algorithm for a particular problem, called the algorithm selection (AS) problem. By reason of inherent human bias and limited expert knowledge, the vision of automating the selection process has quickly gained traction in the community. One prominent way of doing so is via so-called landscape-aware AS, where the choice of the algorithm is based on predicting its performance by means of numerical problem instance representations called features. A key challenge that landscape-aware AS faces is the computational overhead of extracting the features, a step typically designed to precede the actual optimization. In this thesis, we propose a novel trajectory-based landscape-aware AS approach which incorporates the feature extraction step within the optimization process. We show that the features computed using the search trajectory samples lead to robust and reliable predictions of algorithm performance, and to powerful algorithm selection models built atop. We also present several preparatory analyses, including a novel perspective of combining two complementary regression strategies that outperforms any of the classical, single regression models, to amplify the quality of the final selector
Samaké, Oumar. "Analyse thermo-économique d'un système de dessalement par thermocompression de vapeur et conception de l'éjecteur". Thèse, Université de Sherbrooke, 2016. http://hdl.handle.net/11143/8782.
Texto completo da fonteTorossian, Léonard. "Méthodes d'apprentissage statistique pour la régression et l'optimisation globale de mesures de risque". Thesis, Toulouse 3, 2019. http://www.theses.fr/2019TOU30192.
Texto completo da fonteThis thesis presents methods for estimation and optimization of stochastic black box functions. Motivated by the necessity to take risk-averse decisions in medecine, agriculture or finance, in this study we focus our interest on indicators able to quantify some characteristics of the output distribution such as the variance or the size of the tails. These indicators also known as measure of risk have received a lot of attention during the last decades. Based on the existing literature on risk measures, we chose to focus this work on quantiles, CVaR and expectiles. First, we will compare the following approaches to perform quantile regression on stochastic black box functions: the K-nearest neighbors, the random forests, the RKHS regression, the neural network regression and the Gaussian process regression. Then a new regression model is proposed in this study that is based on chained Gaussian processes inferred by variational techniques. Though our approach has been initially designed to do quantile regression, we showed that it can be easily applied to expectile regression. Then, this study will focus on optimisation of risk measures. We propose a generic approach inspired from the X-armed bandit which enables the creation of an optimiser and an upper bound on the simple regret that can be adapted to any risk measure. The importance and relevance of this approach is illustrated by the optimization of quantiles and CVaR. Finally, some optimisation algorithms for the conditional quantile and expectile are developed based on Gaussian processes combined with UCB and Thompson sampling strategies
Bittar, Thomas. "Stochastic optimization of maintenance scheduling : blackbox methods, decomposition approaches - Theoretical and numerical aspects". Thesis, Marne-la-vallée, ENPC, 2021. http://www.theses.fr/2021ENPC2004.
Texto completo da fonteThe aim of the thesis is to develop algorithms for optimal maintenance scheduling. We focus on the specific case of large systems that consist of several components linked by a common stock of spare parts. The numerical experiments are carried out on systems of components from a single hydroelectric power plant.The first part is devoted to blackbox methods which are commonly used in maintenance scheduling. We focus on a kriging-based algorithm, Efficient Global Optimization (EGO), and on a direct search method, Mesh Adaptive Direct Search (MADS). We present a theoretical and practical review of the algorithms as well as some improvements for the implementation of EGO. MADS and EGO are compared on an academic benchmark and on small industrial maintenance problems, showing the superiority of MADS but also the limitation of the blackbox approach when tackling large-scale problems.In a second part, we want to take into account the fact that the system is composed of several components linked by a common stock in order to address large-scale maintenance optimization problems. For that purpose, we develop a model of the dynamics of the studied system and formulate an explicit stochastic optimal control problem. We set up a scheme of decomposition by prediction, based on the Auxiliary Problem Principle (APP), that turns the resolution of the large-scale problem into the iterative resolution of a sequence of subproblems of smaller size. The decomposition is first applied on synthetic test cases where it proves to be very efficient. For the industrial case, a "relaxation" of the system is needed and developed to apply the decomposition methodology. In the numerical experiments, we solve a Sample Average Approximation (SAA) of the problem and show that the decomposition leads to substantial gains over the reference algorithm.As we use a SAA method, we have considered the APP in a deterministic setting. In the third part, we study the APP in the stochastic approximation framework in a Banach space. We prove the measurability of the iterates of the algorithm, extend convergence results from Hilbert spaces to Banach spaces and give efficiency estimates
Loshchilov, Ilya. "Surrogate-Assisted Evolutionary Algorithms". Phd thesis, Université Paris Sud - Paris XI, 2013. http://tel.archives-ouvertes.fr/tel-00823882.
Texto completo da fonteLivros sobre o assunto "Optimisation de boîte noire"
Sautreau, Serge. Boîte noire. [Montréal]: nbj, 1986.
Encontre o texto completo da fonteMartelly, Stéphane. La boîte noire: Suivi de Départs. Montpellier, Québec: Écrits des hautes-terres, 2004.
Encontre o texto completo da fonte1911-, Lussier Philippe, ed. La boîte noire retrouvée: Biographie de Jean-Philibert Lussier. Sainte-Foy [Québec]: Éditions A. Sigier, 1985.
Encontre o texto completo da fonteLa philosophie dans la boîte noire: Cinq pièces faciles sur Wittgenstein. Paris: Kimé, 2000.
Encontre o texto completo da fonteMSSYEH, Taha. Boîte Noire. Independently Published, 2019.
Encontre o texto completo da fonteRobert, Denis. La Boîte noire. Les Arènes, 2002.
Encontre o texto completo da fonteFerrandez, Jacques, e Tonino Benacquista. La Boîte noire. Gallimard - Futuropolis, 2000.
Encontre o texto completo da fonteBenozigl. La Boîte noire. Seuil, 1999.
Encontre o texto completo da fonteLuc-Lecomte, Quentin, e Tony Wart. Quaero: La Boîte Noire. Independently Published, 2019.
Encontre o texto completo da fonteZaoui, Amin. La boîte noire de l'islam. TAFAT EDITIONS, 2018.
Encontre o texto completo da fonteCapítulos de livros sobre o assunto "Optimisation de boîte noire"
"L’INVENTEUR DE LA « BOÎTE NOIRE »". In Pierre Jeanniot, 163–70. Presses de l'Université du Québec, 2011. http://dx.doi.org/10.2307/j.ctv18phfr8.21.
Texto completo da fontePratt, Andy, e Gavin Parker. "Science, technologie, innovation : ouvrir la boîte noire". In Recherche et développement régional, 185–94. Éditions de la Sorbonne, 1997. http://dx.doi.org/10.4000/books.psorbonne.37131.
Texto completo da fonteAïdan, Geraldine, e Primavera De Filippi. "LE IUS ARTIFICIALE ENTRE INTÉRIORITÉ ET BOÎTE NOIRE:". In Les intelligences artificielles au prisme de la justice sociale. Considering Artificial Intelligence Through the Lens of Social Justice, 229–50. Presses de l'Université Laval, 2023. http://dx.doi.org/10.2307/jj.9165171.12.
Texto completo da fonteDaumas, Jean-Claude. "1. Dans la « boîte noire » des districts industriels". In Les territoires de l’industrie en Europe (1750-2000), 9–34. Presses universitaires de Franche-Comté, 2007. http://dx.doi.org/10.4000/books.pufc.27344.
Texto completo da fonteFavereau, Judith. "Du paternalisme libertarien au paternalisme démocratique : une boîte noire vide ?" In Le hasard de la preuve, 217–47. ENS Éditions, 2021. http://dx.doi.org/10.4000/books.enseditions.39342.
Texto completo da fonte"9: Gourous et boîte noire : 50 ans de dérive médiatique". In Un regard passionné sur les lipides et les matières grasses, 241–58. EDP Sciences, 2020. http://dx.doi.org/10.1051/978-2-7598-2075-7-012.
Texto completo da fonte"9: Gourous et boîte noire : 50 ans de dérive médiatique". In Un regard passionné sur les lipides et les matières grasses, 241–58. EDP Sciences, 2020. http://dx.doi.org/10.1051/978-2-7598-2075-7.c012.
Texto completo da fonteNeveu, Catherine. "Chapitre 4. Conception du pouvoir d’agir et rapports sociaux : dans la « boîte noire » d’une « Boîte à prêts »". In Le pouvoir d’agir dans les centres sociaux, 97–118. Presses universitaires du Septentrion, 2023. http://dx.doi.org/10.4000/books.septentrion.141452.
Texto completo da fonteBenhamou, Salima. "Que sait‐on du travail ?" In Que sait‐on du travail ?, 176–91. Presses de Sciences Po, 2023. http://dx.doi.org/10.3917/scpo.colle.2023.01.0176.
Texto completo da fonteGrandazzi, Albane, e Juliette Senn. "L’expérience de la thèse en management". In L’expérience de la thèse en management, 322–35. EMS Editions, 2023. http://dx.doi.org/10.3917/ems.gaill.2023.01.0322.
Texto completo da fonte