Littérature scientifique sur le sujet « Heuristic »
Créez une référence correcte selon les styles APA, MLA, Chicago, Harvard et plusieurs autres
Sommaire
Consultez les listes thématiques d’articles de revues, de livres, de thèses, de rapports de conférences et d’autres sources académiques sur le sujet « Heuristic ».
À côté de chaque source dans la liste de références il y a un bouton « Ajouter à la bibliographie ». Cliquez sur ce bouton, et nous générerons automatiquement la référence bibliographique pour la source choisie selon votre style de citation préféré : APA, MLA, Harvard, Vancouver, Chicago, etc.
Vous pouvez aussi télécharger le texte intégral de la publication scolaire au format pdf et consulter son résumé en ligne lorsque ces informations sont inclues dans les métadonnées.
Articles de revues sur le sujet "Heuristic"
Sanggala, Ekra, et Muhammad Ardhya Bisma. « Perbandingan Savings Algorithm dengan Nearest Neighbour dalam Menyelesaikan Russian TSP Instances ». Jurnal Media Teknik dan Sistem Industri 7, no 1 (31 mars 2023) : 27. http://dx.doi.org/10.35194/jmtsi.v7i1.3039.
Texte intégralSeipp, Jendrik. « Better Orders for Saturated Cost Partitioning in Optimal Classical Planning ». Proceedings of the International Symposium on Combinatorial Search 8, no 1 (1 septembre 2021) : 149–53. http://dx.doi.org/10.1609/socs.v8i1.18438.
Texte intégralWilt, Christopher, et Wheeler Ruml. « Effective Heuristics for Suboptimal Best-First Search ». Journal of Artificial Intelligence Research 57 (31 octobre 2016) : 273–306. http://dx.doi.org/10.1613/jair.5036.
Texte intégralUrsani, Ziauddin, et David W. Corne. « Introducing Complexity Curtailing Techniques for the Tour Construction Heuristics for the Travelling Salesperson Problem ». Journal of Optimization 2016 (2016) : 1–15. http://dx.doi.org/10.1155/2016/4786268.
Texte intégralShperberg, Shahaf, Ariel Felner, Lior Siag et Nathan R. Sturtevant. « On the Properties of All-Pair Heuristics ». Proceedings of the International Symposium on Combinatorial Search 17 (1 juin 2024) : 127–33. http://dx.doi.org/10.1609/socs.v17i1.31550.
Texte intégralChen, Dillon Z., et Sylvie Thiébaux. « Novelty Heuristics, Multi-Queue Search, and Portfolios for Numeric Planning ». Proceedings of the International Symposium on Combinatorial Search 17 (1 juin 2024) : 203–7. http://dx.doi.org/10.1609/socs.v17i1.31559.
Texte intégralÖzcan, Ender, Mustafa Misir, Gabriela Ochoa et Edmund K. Burke. « A Reinforcement Learning - Great-Deluge Hyper-Heuristic for Examination Timetabling ». International Journal of Applied Metaheuristic Computing 1, no 1 (janvier 2010) : 39–59. http://dx.doi.org/10.4018/jamc.2010102603.
Texte intégralKuroiwa, Ryo, Alexander Shleyfman, Chiara Piacentini, Margarita P. Castro et J. Christopher Beck. « LM-cut and Operator Counting Heuristics for Optimal Numeric Planning with Simple Conditions ». Proceedings of the International Conference on Automated Planning and Scheduling 31 (17 mai 2021) : 210–18. http://dx.doi.org/10.1609/icaps.v31i1.15964.
Texte intégralBOUZY, BRUNO. « HISTORY AND TERRITORY HEURISTICS FOR MONTE CARLO GO ». New Mathematics and Natural Computation 02, no 02 (juillet 2006) : 139–46. http://dx.doi.org/10.1142/s1793005706000427.
Texte intégralWilt, Christopher, et Wheeler Ruml. « Speedy Versus Greedy Search ». Proceedings of the International Symposium on Combinatorial Search 5, no 1 (1 septembre 2021) : 184–92. http://dx.doi.org/10.1609/socs.v5i1.18320.
Texte intégralThèses sur le sujet "Heuristic"
Peake, Katharine Louise. « Composition heuristics and theories and a proposed heuristic for business writing ». CSUSB ScholarWorks, 2007. https://scholarworks.lib.csusb.edu/etd-project/3282.
Texte intégralAmbrogi, Timothy. « Heuristic counterpoint ». Diss., Connect to the thesis, 2004. http://hdl.handle.net/10066/1484.
Texte intégralMurthy, Sapna Guniguntla. « Disaster recovery heuristic : a mapping heuristic for optimum retrieval / ». Online version of thesis, 2009. http://hdl.handle.net/1850/10733.
Texte intégralGUTIERRES, RICARDO. « ADAPTIVE HEURISTIC CONTROLLERS ». PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO, 1991. http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=9409@1.
Texte intégralUm controlador Heurístico Adaptativo baseia-se num conjunto de regras lingüísticas para conduzir um processo com modelo impreciso ou complexo ao estado desejado. O comportamento do processo deve respeitar os requisitos de performance predefinidos. Para satisfazer estes objetivos, a estrutura interna do controle sofre mudanças para adequá- la as condições vigentes no processo. Os métodos de adaptação abordados consideram a modificação de uma estrutura matricial interpretada como as correções incrementais, compatíveis com os ajustes a serem efetuados sobre o processo, ou como regras, constituídas por variáveis nebulosas, que requerem manipulações adicionais para produzir a saída do controlador. Em qualquer dos casos, a adaptação é realizada a partir de uma Tabela de Índices de Performance. Para facilitar a sua obtenção é implementado um procedimento, que fornece a representação matricial das regras lingüísticas, concatenadas na forma de um Algoritmo Lingüístico de Controle. O comportamento dinâmico do Sistema, composto pelos Controladores Heurísticos e por processos com modelos distintos, é considerado para Tabelas de índices de Performance com várias dimensões. As regras lingüísticas, correlacionadas com estas tabelas, foram elaboradas com diversas classes de atributos. As simulações realizadas concentram-se sobre os parâmetros dos controladores, que influenciam significativa- Os estudos abordam também o comportamento da estrutura interna destes controladores e o seu desempenho em termos da velocidade de atuação sobre o processo.
A heuristic Controller uses a set of linguistic rules, which are derived from expertise or human operators´ skills, in order to achieve control of processes that have inaccurate or complex models. An adaptative Heuristic Controller adjusts the set of rules in an automatic and continuous way, aiming to achieve prescribed objectives indicated by a performance measure. The adaptative procedures modify a matrix, the elements of which are either incremental corrections or numeric rules associated with fuzzy variables. In both cases a Performance Index Table and a learning method are employed to correct that matrix. The Performance Table is a matrix calculated from a set of linguistic rules. The controllers are implemented with different Performance Tables, considering various sets of linguistic values and quantization levels. The dynamic behaviour of overdamped and underdamped processes is investigated. The performance of simulated systems is analyzed with respect to relevant parameters that affect their behaviour.
Perry, Kristine. « Heuristic weighted voting / ». Diss., CLICK HERE for online access, 2007. http://contentdm.lib.byu.edu/ETD/image/etd2120.pdf.
Texte intégralMonteith, Kristine Perry. « Heuristic Weighted Voting ». BYU ScholarsArchive, 2007. https://scholarsarchive.byu.edu/etd/1206.
Texte intégralSilva, Renato Teixeira da [UNESP]. « Aplicação de meta-heurísticas na resolução do problema de balanceamento e designação de trabalhadores com deficiência em linha de produção ». Universidade Estadual Paulista (UNESP), 2012. http://hdl.handle.net/11449/93081.
Texte intégralCoordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)
A Organização Internacional do Trabalho estima que existem cerca de 650 milhões de pessoas com deficiência em idade produtiva. No entanto, esta parcela da população possui altos índices de desemprego devido a várias barreiras. Uma alternativa para facilitar a inclusão dessas pessoas é a criação de Centros de Trabalho para pessoas com Deficiência (CTD`s) onde as pessoas com deficiência tenham a oportunidade de experimentar um ambiente de trabalho real antes de irem para um emprego “normal”. Neste tipo de ambiente, onde é impossível ao gestor prever quais trabalhadores estarão disponíveis a cada dia devido às altas taxas de absenteísmo, há a necessidade de se definir uma organização mais produtiva diariamente. Neste contexto se torna oportuna a utilização do Problema de Balanceamento de Linha e Designação de Trabalhadores (em inglês ALWABP), onde se busca minimizar o tempo de ciclo a partir de um dado número de trabalhadores, alocando tarefas às estações de trabalho e trabalhadores às estações, tendo em vista que alguns trabalhadores podem ser muito lentos para executar certas tarefas ou até incapazes, devido a alguma deficiência que eles apresentam, e muito eficientes na execução de outras. O objetivo geral desta dissertação consiste em empregar diferentes meta-heurísticas para resolver o ALWABP, comparando com os melhores resultados das instâncias encontradas na literatura. Dentre várias meta-heurísticas disponíveis na literatura foram utilizados o Harmony Search (HS), o Adaptive Large Neighborhood Search (ALNS) e o Clustering Search (CS) utilizando o HS e o ALNS como heurísticas geradoras de soluções. Cada uma das quatro implementações foram testadas em 320 instâncias propostas na literatura divididas em quatro famílias. Os experimentos computacionais mostraram bons resultados...
The International Labour Organization estimates that there are approximately 650 million disabled people in working age. However, this population presents high rates of unemployment due to numerous barriers. An alternative to facilitate the inclusion of these people is the establishment of Centers for Working People with Disabilities where people with disabilities have the opportunity to experience a real work environment before going to a “normal” job. In this type of environment, where it is impossible to predict which workers will be available each day due to high rates of absence in this population, there is a need to define a more productive organization on a daily basis. In this context it becomes appropriate to use the Assembly Line Worker Assignment and Balancing Problem (ALWABP), which seeks to minimize the cycle time for a given number of workers, assigning tasks to workstations and workers to stations, considering that some workers may be too slow to perform certain tasks, or even unable due to some deficiency they present, and very efficient in performing others. The aim of this dissertation is to employ different meta-heuristics to solve the ALWABP, comparing with the best results of instances found in the literature. Among several meta-heuristics available in the literature were used Harmony Search (HS), Adaptive Large Neighborhood Search (ALNS) and Clustering Search (CS) using the HS and ALNS as heuristics for the generation of solutions. Each of the four implementations has been tested in 320 instances proposed in the literature, classified into four families. The computational experiments showed good results, and in some instances obtaining better solution values best known. Conclusions regarding... (Complete abstract click electronic access below)
Silva, Renato Teixeira da. « Aplicação de meta-heurísticas na resolução do problema de balanceamento e designação de trabalhadores com deficiência em linha de produção / ». Guaratinguetá : [s.n.], 2012. http://hdl.handle.net/11449/93081.
Texte intégralBanca: Marcos Antonio Pereira
Banca: Anibal Tavares de Azevedo
Resumo: A Organização Internacional do Trabalho estima que existem cerca de 650 milhões de pessoas com deficiência em idade produtiva. No entanto, esta parcela da população possui altos índices de desemprego devido a várias barreiras. Uma alternativa para facilitar a inclusão dessas pessoas é a criação de Centros de Trabalho para pessoas com Deficiência (CTD's) onde as pessoas com deficiência tenham a oportunidade de experimentar um ambiente de trabalho real antes de irem para um emprego "normal". Neste tipo de ambiente, onde é impossível ao gestor prever quais trabalhadores estarão disponíveis a cada dia devido às altas taxas de absenteísmo, há a necessidade de se definir uma organização mais produtiva diariamente. Neste contexto se torna oportuna a utilização do Problema de Balanceamento de Linha e Designação de Trabalhadores (em inglês ALWABP), onde se busca minimizar o tempo de ciclo a partir de um dado número de trabalhadores, alocando tarefas às estações de trabalho e trabalhadores às estações, tendo em vista que alguns trabalhadores podem ser muito lentos para executar certas tarefas ou até incapazes, devido a alguma deficiência que eles apresentam, e muito eficientes na execução de outras. O objetivo geral desta dissertação consiste em empregar diferentes meta-heurísticas para resolver o ALWABP, comparando com os melhores resultados das instâncias encontradas na literatura. Dentre várias meta-heurísticas disponíveis na literatura foram utilizados o Harmony Search (HS), o Adaptive Large Neighborhood Search (ALNS) e o Clustering Search (CS) utilizando o HS e o ALNS como heurísticas geradoras de soluções. Cada uma das quatro implementações foram testadas em 320 instâncias propostas na literatura divididas em quatro famílias. Os experimentos computacionais mostraram bons resultados... (Resumo completo, clicar acesso eletrônico abaixo)
Abstract: The International Labour Organization estimates that there are approximately 650 million disabled people in working age. However, this population presents high rates of unemployment due to numerous barriers. An alternative to facilitate the inclusion of these people is the establishment of Centers for Working People with Disabilities where people with disabilities have the opportunity to experience a real work environment before going to a "normal" job. In this type of environment, where it is impossible to predict which workers will be available each day due to high rates of absence in this population, there is a need to define a more productive organization on a daily basis. In this context it becomes appropriate to use the Assembly Line Worker Assignment and Balancing Problem (ALWABP), which seeks to minimize the cycle time for a given number of workers, assigning tasks to workstations and workers to stations, considering that some workers may be too slow to perform certain tasks, or even unable due to some deficiency they present, and very efficient in performing others. The aim of this dissertation is to employ different meta-heuristics to solve the ALWABP, comparing with the best results of instances found in the literature. Among several meta-heuristics available in the literature were used Harmony Search (HS), Adaptive Large Neighborhood Search (ALNS) and Clustering Search (CS) using the HS and ALNS as heuristics for the generation of solutions. Each of the four implementations has been tested in 320 instances proposed in the literature, classified into four families. The computational experiments showed good results, and in some instances obtaining better solution values best known. Conclusions regarding... (Complete abstract click electronic access below)
Mestre
Hosny, Manar Ibrahim. « Investigating heuristic and meta-heuristic algorithms for solving pickup and delivery problems ». Thesis, Cardiff University, 2010. http://orca.cf.ac.uk/55181/.
Texte intégralSanusi, Afeez Ayinla. « Train Dispatching : Heuristic Optimization ». Thesis, Högskolan Dalarna, Datateknik, 2006. http://urn.kb.se/resolve?urn=urn:nbn:se:du-4107.
Texte intégralLivres sur le sujet "Heuristic"
Salhi, Saïd. Heuristic Search. Cham : Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-49355-8.
Texte intégralIppoliti, Emiliano, dir. Heuristic Reasoning. Cham : Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-09159-4.
Texte intégralTahin, Gábor. Heuristic Rhetoric. Cham : Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-030-98482-3.
Texte intégralNirmal, Arvind P. Heuristic explorations. Madras : Published for Gurukul Lutheran Theological College & Research Institute by Christian Literature Society, 1990.
Trouver le texte intégralClancey, William J. Heuristic classification. [Alexandria, Va.] : DTIC, 1985.
Trouver le texte intégralLappin, Gerald F. Heuristic symbolic integration. [S.l : The Author], 1987.
Trouver le texte intégralDasgupta, Pallab, P. P. Chakrabarti et S. C. DeSarkar. Multiobjective Heuristic Search. Wiesbaden : Vieweg+Teubner Verlag, 1999. http://dx.doi.org/10.1007/978-3-322-86853-4.
Texte intégralMoustakas, Clark E. Heuristic research : Design, methodology, and applications. Newbury Park : Sage Publications, 1990.
Trouver le texte intégralLee, Kwang Y., et Mohamed A. El-Sharkawi, dir. Modern Heuristic Optimization Techniques. Hoboken, NJ, USA : John Wiley & Sons, Inc., 2008. http://dx.doi.org/10.1002/9780470225868.
Texte intégralHegeman, J. H. Justifying policy : A heuristic. Amsterdam : Free University Press, 1989.
Trouver le texte intégralChapitres de livres sur le sujet "Heuristic"
Pirrone, Angelo, Peter C. R. Lane, Laura Bartlett, Noman Javed et Fernand Gobet. « Heuristic Search of Heuristics ». Dans Artificial Intelligence XL, 407–20. Cham : Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-47994-6_36.
Texte intégralGass, Saul I., et Carl M. Harris. « heuristic ». Dans Encyclopedia of Operations Research and Management Science, 731. New York, NY : Springer US, 2001. http://dx.doi.org/10.1007/1-4020-0611-x_905.
Texte intégralGass, Saul I., et Carl M. Harris. « heuristic ». Dans Encyclopedia of Operations Research and Management Science, 731. New York, NY : Springer US, 2001. http://dx.doi.org/10.1007/1-4020-0611-x_906.
Texte intégralWeik, Martin H. « heuristic ». Dans Computer Science and Communications Dictionary, 721. Boston, MA : Springer US, 2000. http://dx.doi.org/10.1007/1-4020-0613-6_8330.
Texte intégralXiang, Yao, et Yan Guoli. « Heuristic ». Dans The ECPH Encyclopedia of Psychology, 1–2. Singapore : Springer Nature Singapore, 2024. http://dx.doi.org/10.1007/978-981-99-6000-2_311-1.
Texte intégralSalhi, Saïd. « Introduction ». Dans Heuristic Search, 1–18. Cham : Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-49355-8_1.
Texte intégralSalhi, Saïd. « Improvement-Only Heuristics ». Dans Heuristic Search, 19–47. Cham : Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-49355-8_2.
Texte intégralSalhi, Saïd. « Not Necessary Improving Heuristics ». Dans Heuristic Search, 49–76. Cham : Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-49355-8_3.
Texte intégralSalhi, Saïd. « Population-Based Heuristics ». Dans Heuristic Search, 77–128. Cham : Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-49355-8_4.
Texte intégralSalhi, Saïd. « Hybridisation Search ». Dans Heuristic Search, 129–56. Cham : Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-49355-8_5.
Texte intégralActes de conférences sur le sujet "Heuristic"
Hitomi, Nozomi, et Daniel Selva. « The Effect of Credit Definition and Aggregation Strategies on Multi-Objective Hyper-Heuristics ». Dans ASME 2015 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. American Society of Mechanical Engineers, 2015. http://dx.doi.org/10.1115/detc2015-47445.
Texte intégralPuentes, Lucas, Jonathan Cagan et Christopher McComb. « Automated Heuristic Induction From Human Design Data ». Dans ASME 2020 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. American Society of Mechanical Engineers, 2020. http://dx.doi.org/10.1115/detc2020-22151.
Texte intégralKoriche, Frederic, Christophe Lecoutre, Anastasia Paparrizou et Hugues Wattez. « Best Heuristic Identification for Constraint Satisfaction ». Dans Thirty-First International Joint Conference on Artificial Intelligence {IJCAI-22}. California : International Joint Conferences on Artificial Intelligence Organization, 2022. http://dx.doi.org/10.24963/ijcai.2022/258.
Texte intégralLiang, Jia, Hari Govind, Pascal Poupart, Krzysztof Czarnecki et Vijay Ganesh. « An Empirical Study of Branching Heuristics through the Lens of Global Learning Rate ». Dans Twenty-Seventh International Joint Conference on Artificial Intelligence {IJCAI-18}. California : International Joint Conferences on Artificial Intelligence Organization, 2018. http://dx.doi.org/10.24963/ijcai.2018/745.
Texte intégralBercher, Pascal, Gregor Behnke, Daniel Höller et Susanne Biundo. « An Admissible HTN Planning Heuristic ». Dans Twenty-Sixth International Joint Conference on Artificial Intelligence. California : International Joint Conferences on Artificial Intelligence Organization, 2017. http://dx.doi.org/10.24963/ijcai.2017/68.
Texte intégralYokoyama, Soichiro, Ikuo Suzuki, Masahito Yamamoto et Masashi Furukawa. « A New Heuristic for Traveling Salesman Problem Based on LCO ». Dans ASME/ISCIE 2012 International Symposium on Flexible Automation. American Society of Mechanical Engineers, 2012. http://dx.doi.org/10.1115/isfa2012-7227.
Texte intégralHu, Shuli, et Nathan R. Sturtevant. « Direction-Optimizing Breadth-First Search with External Memory Storage ». Dans Twenty-Eighth International Joint Conference on Artificial Intelligence {IJCAI-19}. California : International Joint Conferences on Artificial Intelligence Organization, 2019. http://dx.doi.org/10.24963/ijcai.2019/175.
Texte intégralCohen, Liron, Tansel Uras, Shiva Jahangiri, Aliyah Arunasalam, Sven Koenig et T. K. Satish Kumar. « The FastMap Algorithm for Shortest Path Computations ». Dans Twenty-Seventh International Joint Conference on Artificial Intelligence {IJCAI-18}. California : International Joint Conferences on Artificial Intelligence Organization, 2018. http://dx.doi.org/10.24963/ijcai.2018/198.
Texte intégralRenan de Carvalho, Vinicius, et Jaime Simão Sichman. « Multi-Agent Election-Based Hyper-Heuristics ». Dans Twenty-Seventh International Joint Conference on Artificial Intelligence {IJCAI-18}. California : International Joint Conferences on Artificial Intelligence Organization, 2018. http://dx.doi.org/10.24963/ijcai.2018/833.
Texte intégralLi, Ya-zhou, Jin Wang, Li-qin Hu et Yi-can Wu. « A Variable Ordering Heuristic Based on Zero-Suppressed Binary Decision Diagrams ». Dans 18th International Conference on Nuclear Engineering. ASMEDC, 2010. http://dx.doi.org/10.1115/icone18-30070.
Texte intégralRapports d'organisations sur le sujet "Heuristic"
Feigenbaum, Edward A., et Bruce G. Buchanan. Heuristic Programming Project. Fort Belvoir, VA : Defense Technical Information Center, mars 1986. http://dx.doi.org/10.21236/ada165995.
Texte intégralCarter, Lynn. Probability driven heuristic nets. Portland State University Library, janvier 2000. http://dx.doi.org/10.15760/etd.1998.
Texte intégralEvett, Matthew, James Hendler, Ambuj Mahanti et Dana Nau. PRA : Massively Parallel Heuristic Search. Fort Belvoir, VA : Defense Technical Information Center, janvier 1991. http://dx.doi.org/10.21236/ada454848.
Texte intégralHirshleifer, David, Yaron Levi, Ben Lourie et Siew Hong Teoh. Decision Fatigue and Heuristic Analyst Forecasts. Cambridge, MA : National Bureau of Economic Research, février 2018. http://dx.doi.org/10.3386/w24293.
Texte intégralSkiena, Steven S. Heuristic Approaches to Optimization with Applications. Fort Belvoir, VA : Defense Technical Information Center, août 2001. http://dx.doi.org/10.21236/ada390374.
Texte intégralSkiena, Steven S. Heuristic Approaches to Optimization With Applications. Fort Belvoir, VA : Defense Technical Information Center, août 2000. http://dx.doi.org/10.21236/ada382413.
Texte intégralNemhauser, George L., et Martin W. Savelsbergh. Combining Exact and Heuristic Approaches for Discrete Optimization. Fort Belvoir, VA : Defense Technical Information Center, février 2009. http://dx.doi.org/10.21236/ada495432.
Texte intégralKaku, Bharat K., Thomas E. Morton et Gerald L. Thompson. A Heuristic Algorithm for the Facilities Layout Problem. Fort Belvoir, VA : Defense Technical Information Center, mai 1988. http://dx.doi.org/10.21236/ada196093.
Texte intégralNemhauser, George L. Combining Exact ad Heuristic Approaches for Discrete Optimization. Fort Belvoir, VA : Defense Technical Information Center, décembre 2011. http://dx.doi.org/10.21236/ada567596.
Texte intégralMartínez Martínez, Luis Enrique, et Juan M. Monserrat Gauchi. Heuristic Evaluation of Optical and Optometry Franchise Websites. Revista Latina de Comunicación Social, 2010. http://dx.doi.org/10.4185/rlcs-65-2010-884-071-088-en.
Texte intégral