Готові списки джерел за темами / Algorithme Design

Зміст

Статті в журналах
Дисертації
Книги
Частини книг
Тези доповідей конференцій
Звіти організацій

Добірка наукової літератури з теми "Algorithme Design"

Автор: Grafiati

Опубліковано: 3 червня 2025

Оновлено: 31 липня 2025

Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями

Оберіть тип джерела:

Ознайомтеся зі списками актуальних статей, книг, дисертацій, тез та інших наукових джерел на тему "Algorithme Design".

Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.

Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.

Статті в журналах з теми "Algorithme Design"

Meita, Rumbayan *. Muhamad Dwisnanto Putro. "A CONCEPT OF SOLAR TRACKER SYSTEM DESIGN." INTERNATIONAL JOURNAL OF ENGINEERING SCIENCES & RESEARCH TECHNOLOGY 6, no. 11 (2017): 440–50. https://doi.org/10.5281/zenodo.1066204.

Повний текст джерела

Анотація:

Improvement of solar panel efficiency is an ongoing research work recently. Maximizing the output power by integrating with the solar tracker system becomes a interest point of the research. This paper presents the concept in designing a solar tracker system applied to solar panel. The development of solar panel tracker system design that consist of system display prototype design, hardware design, and algorithm design. This concept is useful as the control system for solar tracker to improve the efficency of solar panel as the green energy system. For future work, the prototype of solar track

Стилі APA, Harvard, Vancouver, ISO та ін.

John-Mathews, Jean-Marie. "Un cadre d’autorégulation pour l’éthique de L’IA : opportunités et défis." Vie & sciences de l'entreprise N° 216-217, no. 1 (2023): 288–311. http://dx.doi.org/10.3917/vse.216.0288.

Повний текст джерела

Анотація:

Nous proposons un outil d&#8217;autor&#233;gulation pour la conception d&#8217;IA qui int&#232;gre des mesures soci&#233;tales telles que l&#8217;&#233;quit&#233;, l&#8217;interpr&#233;tabilit&#233; et la confidentialit&#233;. Pour ce faire, nous cr&#233;ons une interface qui permet aux praticiens de l&#8217;IA (experts en m&#233;gadonn&#233;es/ data scientists ) de choisir visuellement l&#8217;algorithme d&#8217;apprentissage (Machine Learning/ML) qui correspond le mieux aux pr&#233;f&#233;rences &#233;thiques

Стилі APA, Harvard, Vancouver, ISO та ін.

Goulenok, Cyril, Marc Grassin, Robin Cremer, et al. "Introduction aux enjeux éthiques de l’Intelligence Artificielle en réanimation." Médecine Intensive Réanimation 33, Hors-série 1 (2024): 101–10. http://dx.doi.org/10.37051/mir-00211.

Повний текст джерела

Анотація:

L’Intelligence Artificielle (IA) va occuper une place grandissante en réanimation dans les années à venir. Les possibilités d’utilisation seront très larges, couvrant notamment les champs des prédictions, de l’aide à la décision, de l’imagerie, de la recherche et la formation des soignants. L’implémentation de l’IA en réanimation pourrait significativement bouleverser la prise en charge des patients, mais aussi l’activité des médecins. Ces changements à venir amènent des questionnements éthiques spécifiques qu’il est nécessaire et urgent d’évoquer. De la mise au point d’un algorithme jusqu’à s

Стилі APA, Harvard, Vancouver, ISO та ін.

Dharani Pragada, Venkata Aditya, Akanistha Banerjee, and Srinivasan Venkataraman. "OPTIMISATION OF NAVAL SHIP COMPARTMENT LAYOUT DESIGN USING GENETIC ALGORITHM." Proceedings of the Design Society 1 (July 27, 2021): 2339–48. http://dx.doi.org/10.1017/pds.2021.495.

Повний текст джерела

Анотація:

AbstractAn efficient general arrangement is a cornerstone of a good ship design. A big part of the whole general arrangement process is finding an optimized compartment layout. This task is especially tricky since the multiple needs are often conflicting, and it becomes a serious challenge for the ship designers. To aid the ship designers, improved and reliable statistical and computation methods have come to the fore. Genetic algorithms are one of the most widely used methods. Islier's algorithm for the multi-facility layout problem and an improved genetic algorithm for the ship layout design

Стилі APA, Harvard, Vancouver, ISO та ін.

An Ouyang. "Visual Attention Analysis and Optimization Algorithm in Packaging Design." Journal of Electrical Systems 20, no. 6s (2024): 96–105. http://dx.doi.org/10.52783/jes.2619.

Повний текст джерела

Анотація:

Visual attention analysis and optimization algorithms in packaging design refer to computational methods aimed at understanding and improving the visual appeal and effectiveness of packaging materials. This study proposes a novel approach for enhancing packaging design through the integration of visual attention analysis and optimization algorithms, employing autoencoder and whale optimization techniques. Visual attention analysis and optimization algorithm in packaging design is to enhance the effectiveness of packaging materials by maximizing their ability to capture and retain consumer atte

Стилі APA, Harvard, Vancouver, ISO та ін.

Ciric, Vladimir, Aleksandar Cvetkovic, Ivan Milentijevic, and Oliver Vojinovic. "All-Pairs Shortest Paths Algorithm for Regular 2D Mesh Topologies." JUCS - Journal of Universal Computer Science 22, no. (11) (2016): 1437–55. https://doi.org/10.3217/jucs-022-11-1437.

Повний текст джерела

Анотація:

Motivated by the large number of vertices that future technologies will put in the front of path-search algorithms, and inspired by highly regular 2D mesh structures that exist in the domain applications, in this paper we propose a new allpairs shortest paths algorithm, for any given regular 2D mesh topology, with complexity Ο(|V|2), where |V| is the number of vertices in the graph. The proposed algorithm can achieve better runtime than other known algorithms at the cost of narrowing the scope of the graphs that it can process to the graphs with regular 2D topology. The algorithm is developed

Стилі APA, Harvard, Vancouver, ISO та ін.

LI, JIANG, MICHAEL T. MANRY, CHANGHUA YU, and D. RANDALL WILSON. "PROTOTYPE CLASSIFIER DESIGN WITH PRUNING." International Journal on Artificial Intelligence Tools 14, no. 01n02 (2005): 261–80. http://dx.doi.org/10.1142/s0218213005002090.

Повний текст джерела

Анотація:

Algorithms reducing the storage requirement of the nearest neighbor classifier (NNC) can be divided into three main categories: Fast searching algorithms, Instance-based learning algorithms and Prototype based algorithms. We propose an algorithm, LVQPRU, for pruning NNC prototype vectors and a compact classifier with good performance is obtained. The basic condensing algorithm is applied to the initial prototypes to speed up the learning process. The learning vector quantization (LVQ) algorithm is utilized to fine tune the remaining prototypes during each pruning iteration. We evaluate LVQPRU

Стилі APA, Harvard, Vancouver, ISO та ін.

Sakri, Leena I., Deepa Bendigeri, Sachin Joshi, et al. "Visualizer for Algorithms and Path Finding with User Interface Design." International Journal for Research in Applied Science and Engineering Technology 11, no. 5 (2023): 5902–7. http://dx.doi.org/10.22214/ijraset.2023.52237.

Повний текст джерела

Анотація:

Abstract: A graphical description of how algorithms like sorting and path finding work is provided by the Algorithm and Path Finding visualizer. The system thoroughly explains each process using both text and animation. Dots, lines, dimensional bars, and other graphic elements are combined to create an algorithm visualisation, which shows some of the algorithm's more "interesting events." The benefits of the algorithm visualizer include a user-friendly UI. It's easy to use the UI. Users move easily and without exertion. input of data entry by users is possible in the system. User command Users

Стилі APA, Harvard, Vancouver, ISO та ін.

Al-Bazoon, Mustafa, and Jasbir Arora. "A Hybrid Stochastic Algorithm with Domain Reduction for Discrete Structural Optimization." Misan Journal of Engineering Sciences 1, no. 2 (2020): 16–36. http://dx.doi.org/10.61263/mjes.v1i2.14.

Повний текст джерела

Анотація:

In recent years, many nature-inspired metaheuristic optimization algorithms have been proposed in an effort to develop efficient and robust algorithms. The drawback in most of them is the large number of simulations required to obtain good designs. To reduce the number of structural analyses to reach the best design, a new two-phase algorithm is proposed and evaluated. This hybrid algorithm is based on the well-known Harmony Search (HS) algorithm and recently developed Colliding Bodied Optimization (CBO). HS analyzes and improves one design in every iteration whereas CBO generates and analyzes

Стилі APA, Harvard, Vancouver, ISO та ін.

Narasimha Nayak, V., M. Ravi Kumar, K. Anusha, and Ch Kranthi Kiran. "FPGA based asymmetric crypto system design." International Journal of Engineering & Technology 7, no. 1.1 (2017): 612. http://dx.doi.org/10.14419/ijet.v7i1.1.10788.

Повний текст джерела

Анотація:

In the network security system cryptography plays a vital role for the secure transmission of information. Cryptography is a process of integrating and transferring the data to the genuine users against any attacks. There are two types of Cryptographic algorithm: Symmetric and Asymmetric algorithms. In the symmetric type cryptography, single key is used for both encryption and decryption. Symmetric algorithms are fast and simple. Asymmetric cryptographic algorithm uses different keys such as public key to encrypt the message at sender and private key which is known only to receiver for decrypt

Стилі APA, Harvard, Vancouver, ISO та ін.

Більше джерел

Дисертації з теми "Algorithme Design"

Sergeeva, Marina. "Sectorisation automatisée de l'espace aérien par algorithme génétique." Thesis, Toulouse 3, 2017. http://www.theses.fr/2017TOU30121.

Повний текст джерела

Анотація:

Avec la croissance continue du trafic aérien et la limitation des ressources, il est nécessaire de réduire la congestion de l'espace aérien. Ces dernières années, un intérêt particulier a été porté au problème de la sectorisation de l'espace aérien.Pour pallier à cette augmentation continue du trafic en Europe, il est nécessaire d'optimiser la gestion du trafic aérien. Une automatisation de la sectorisation de l'espace aérien peut permettre, dans cette optique, d'accroître l'adaptabilité des configurations du secteur aérien à une nouvelle demande de trafic. L'objectif de la première partie de

Стилі APA, Harvard, Vancouver, ISO та ін.

Marin, Philippe. "Exploration des mécanismes évolutionnaires appliqués à la conception architecturale : mise en oeuvre d'un algorithme génétique guidé par les qualités solaires passives de l'enveloppe." Thesis, Vandoeuvre-les-Nancy, INPL, 2010. http://www.theses.fr/2010INPL022N/document.

Повний текст джерела

Анотація:

Cette recherche porte sur l’exploration et la qualification des dispositifs évolutionnaires appliquées à la conception architecturale. Ici, ce sont les qualités environnementales et plus particulièrement les qualités solaires passives de l’enveloppe de l’édifice qui guideront le processus évolutionnaire. Nous nous attachons plus particulièrement aux phases initiales de la conception, et nous cherchons à spécifier un outil d’assistance favorisant et stimulant une conception créative. Après avoir établi et structuré une connaissance sur les processus de conception, sur la créativité, sur les qua

Стилі APA, Harvard, Vancouver, ISO та ін.

Brillu, Romain. "Efficient design and programming of multiple processors system on chip architectures." Nantes, 2014. http://www.theses.fr/2014NANT2054.

Повний текст джерела

Анотація:

Les applications embarquées incorporent de plus en plus de fonctionnalités impliquant différents types de traitement à réaliser. L'impact majeur de cette demande est l'évolution croissante des systèmes embarqués que cela soit en terme de performances et de capacité mémoire. Ces systèmes doivent en effet trouver un compromis entre leurs capacités (puissance de calcul, dynamicité) et les contraintes du domaine d'application. Face à cette évolution les architectures MPSoC apparaissent actuellement comme les principaux promoteurs de la révolution industrielle des semiconducteurs. Cependant, la con

Стилі APA, Harvard, Vancouver, ISO та ін.

Pellegrini, Eric. "Elaboration d'un algorithme de Drug Design : aspects fondamentaux et application à une protéine." Université Joseph Fourier (Grenoble), 2002. http://www.theses.fr/2002GRE10229.

Повний текст джерела

Анотація:

Elaboration d'un algorithme de drug design: aspects fondamentaux et application à une protéine. Les perspectives offertes par le séquençage du génome humain, associées aux progrès conjointement effectués dans les domaines de la résolution de structures protéiques et de l'informatique, ouvrent de nouveaux horizons dans le domaine de la conception de médicaments assistés par ordinateurs. Cette thèse a consisté en l'élaboration d'un algorithme de Drug Design. Pour cela, certains aspects fondamentaux, comme la prise en compte de la flexibilité du ligand ou l'introduction de la solvatation pour l'é

Стилі APA, Harvard, Vancouver, ISO та ін.

Souaille, Ava. "Conception Interactive en Design Sonore." Electronic Thesis or Diss., Ecole centrale de Nantes, 2023. http://www.theses.fr/2023ECDN0009.

Повний текст джерела

Анотація:

La problématique de cette thèse porte sur la définition d’outils et de méthodes interactives pour le design sonore, permettant d'intégrer l’expérience utilisateur dans le processus de conception. Nous proposons un paradigme expérimental d'étude de laperception sonore, basé l'optimisation interactive de sons. En particulier, nous utilisons des Algorithmes Génétiques Interactifs (IGAs) pour résoudre deux problèmes de design sonore: le design de sons d'alerte de véhicules électriques ou hybrides facilement détectables et peu désagréables, ainsi que le design de sons d'intérieur peu intrusifs pour

Стилі APA, Harvard, Vancouver, ISO та ін.

Marin, Philippe. "Exploration des mécanismes évolutionnaires appliqués à la conception architecturale : mise en oeuvre d'un algorithme génétique guidé par les qualités solaires passives de l'enveloppe." Electronic Thesis or Diss., Vandoeuvre-les-Nancy, INPL, 2010. http://www.theses.fr/2010INPL022N.

Повний текст джерела

Анотація:

Стилі APA, Harvard, Vancouver, ISO та ін.

Filip, Silviu-Ioan. "Robust tools for weighted Chebyshev approximation and applications to digital filter design." Thesis, Lyon, 2016. http://www.theses.fr/2016LYSEN063/document.

Повний текст джерела

Анотація:

De nombreuses méthodes de traitement du signal reposent sur des résultats puissants d'approximation numérique. Un exemple significatif en est l'utilisation de l'approximation de type Chebyshev pour l'élaboration de filtres numériques.En pratique, le caractère fini des formats numériques utilisés en machine entraîne des difficultés supplémentaires pour la conception de filtres numériques (le traitement audio et le traitement d'images sont deux domaines qui utilisent beaucoup le filtrage). La majorité des outils actuels de conception de filtres ne sont pas optimisés et ne certifient pas non plus

Стилі APA, Harvard, Vancouver, ISO та ін.

Tchvagha, Zeine Ahmed. "Contribution à l’optimisation multi-objectifs sous contraintes : applications à la mécanique des structures." Thesis, Normandie, 2018. http://www.theses.fr/2018NORMIR13/document.

Повний текст джерела

Анотація:

L’objectif de cette thèse est le développement de méthodes d’optimisation multi-objectif pour la résolution de problèmes de conception des structures mécaniques. En effet, la plupart des problèmes réels dans le domaine de la mécanique des structures ont plusieurs objectifs qui sont souvent antagonistes. Il s’agit, par exemple, de concevoir des structures en optimisant leurs poids, leurs tailles, et leurs coûts de production. Le but des méthodes d’optimisation multi-objectif est la recherche des solutions de compromis entre les objectifs étant donné l’impossibilité de satisfaire tout simultaném

Стилі APA, Harvard, Vancouver, ISO та ін.

Pereira, Vargas Liguori Pedro. "Polyhedral approaches for some network design problems." Thesis, Paris Sciences et Lettres (ComUE), 2019. http://www.theses.fr/2019PSLED074.

Повний текст джерела

Анотація:

Cette thèse étudie les aspects polyhédraux de certains problèmes de conception de réseau, en se concentrant principalement sur les aspects liés à la connectivité dessous-structures nécessaires pour créer des applications réseau fiables. Le cœur de nombreuses applications différentes de conception de réseau réside dans le fait qu’il est nécessaire de fournir un sous-réseau connexe (pouvant être compris comme un ensemble de sommets ou d’arêtes induisant un sous-graphe connecté) pouvant présenter d’autres propriétés souhaitables, comme atteindre un certain niveau de capacité de survie ou de robus

Стилі APA, Harvard, Vancouver, ISO та ін.

Jourand, David. "Etude théorique du mécanisme réactionnel de la neuraminidase d'Influenza B : conception d'un algorithme de Drug Design." Université Joseph Fourier (Grenoble), 1997. http://www.theses.fr/1997GRE10158.

Повний текст джерела

Анотація:

Deux types de recherches complementaires concernant la neuraminidase du virus influenza sont presentes : d'une part l'etude theorique de son mecanisme catalytique et d'autre part la conception d'un algorithme de drug design theoriquement capable de creer des ligands interagissant avec son site actif. Des etudes experimentales et cristallographiques de la neuraminidase d'influenza b, qui hydrolyse un acide sialique terminal de glycoproteines, de glycolipides, ou d'oligosaccharides ont permis d'identifier le site actif et de proposer des mecanismes reactionnels possibles. Cette reaction se reali

Стилі APA, Harvard, Vancouver, ISO та ін.

Більше джерел

Книги з теми "Algorithme Design"

Smith, Jeffrey Dean. Design and analysis of algorithms. PWS-KENT Pub. Co., 1989.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Baase, Sara. Computer algorithms: Introduction to design and analysis. 2nd ed. Addison-Wesley Pub. Co., 1991.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Baase, Sara. Computer algorithms: Introduction to design and analysis. 2nd ed. Addison-Wesley Pub. Co., 1988.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Éva, Tardos, ed. Algorithm design. Pearson/Addison-Wesley, 2006.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Mihaila, Ioanna Felicia. Design coloring algorithms. University of Toronto, Dept. of Computer Science, 1995.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Mihaila, Ioana Felicia. Design coloring algorithms. National Library of Canada, 1995.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Ker-I, Ko, and Hu Xiaodong 1962-, eds. Design and analysis of approximation algorithms. Springer, 2012.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Pieprzyk, Josef, and Babak Sadeghiyan, eds. Design of Hashing Algorithms. Springer Berlin Heidelberg, 1993. http://dx.doi.org/10.1007/3-540-57500-6.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Kershenbaum, Aaron. Telecommunications network design algorithms. McGraw-Hill, 1993.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

1961-, Sadeghiyan Babak, ed. Design of hashing algorithms. Springer-Verlag, 1993.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Більше джерел

Частини книг з теми "Algorithme Design"

Taillard, Éric D. "Elements of Graphs and Complexity Theory." In Design of Heuristic Algorithms for Hard Optimization. Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-031-13714-3_1.

Повний текст джерела

Анотація:

AbstractThis chapter recalls some elements and definitions in graph theory and complexity theory. On the one hand, basic algorithmic courses very often include graph algorithms. Some of these algorithms have simply been transposed to solve difficult optimization problems in a heuristic way. On the other hand, it is important to be able to determine whether a problem falls into the category of difficult problems. Indeed, one will not develop a heuristic algorithm if there is an efficient algorithm to find an exact solution. Another objective of this chapter is to make the book self-contained.

Стилі APA, Harvard, Vancouver, ISO та ін.

Zeng, Yixuan, Qiaoming Deng, and Yubo Liu. "Research on the Spatial Layout Design of University Educational Buildings Based on Rule Screening and Multi-agent System." In Computational Design and Robotic Fabrication. Springer Nature Singapore, 2023. http://dx.doi.org/10.1007/978-981-19-8637-6_5.

Повний текст джерела

Анотація:

AbstractUnlike traditional empiricism-based building design, the data-oriented quantitative analysis method is more rigorous and intuitive, taking into account a variety of factors such as site conditions, functional requirements and design specifications, and combining computer technology to propose a more rational and efficient design strategy. This study takes the design logic process and algorithm rule screening as the entry point to explore the design method of using multi-agent body algorithm planning to realize the spatial layout of university education buildings. Based on multi-agent a

Стилі APA, Harvard, Vancouver, ISO та ін.

Ye, Wei, Xiayu Zhao, and Weiguo Xu. "Simulation Algorithm Based on Weathered Rock Morphology and Optimization Algorithm for Design Applications." In Computational Design and Robotic Fabrication. Springer Nature Singapore, 2023. http://dx.doi.org/10.1007/978-981-19-8637-6_10.

Повний текст джерела

Анотація:

AbstractThe rich organic pore spaces of weathered rocks bring inspiration to architectural design. Based on the existing research on the natural formation mechanism of weathered rocks, this paper proposes two algorithms that achieve natural formation mechanism simulation and morphology simulation. Firstly, this study deeply explores the intrinsic characteristics of weathered rocks; secondly, the basic framework of iterative cyclic calculation by multiple weathering forces is built to make the calculation results of 3D point cloud close to the real morphology of weathered rocks; subsequently, t

Стилі APA, Harvard, Vancouver, ISO та ін.

Storer, James A. "Algorithm Design." In An Introduction to Data Structures and Algorithms. Birkhäuser Boston, 2002. http://dx.doi.org/10.1007/978-1-4612-0075-8_5.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Apke, Alexander, Vera Weil, Jens Dörpinghaus, and Sebastian Schaaf. "Algorithm Design." In Studies in Big Data. Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-031-08411-9_4.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Aragona, Biagio, and Francesco Amato. "Retracing Algorithms: How Digital Social Research Methods Can Track Algorithmic Functioning." In Frontiers in Sociology and Social Research. Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-031-11756-5_8.

Повний текст джерела

Анотація:

AbstractThe expanding use of algorithms in society has called for the emergence of “critical algorithm studies” across several fields, ranging from media studies to geography and from sociology to the humanities. In the past 5 years, a consistent literature on the subject has developed. Inspired by these studies, we explored the ways digital traces may be employed for auditing algorithms and find evidence about algorithmic functioning. We focus on the analysis of digital traces through search engines and Application Programming Interfaces (APIs). We present four cases of how digital traces may

Стилі APA, Harvard, Vancouver, ISO та ін.

Koska, Christopher. "Design Perspectives." In Ethics of Algorithms. Springer Berlin Heidelberg, 2025. https://doi.org/10.1007/978-3-662-71518-5_4.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Cai, Yang, Constantinos Daskalakis, and Matthew Weinberg. "Reducing Bayesian Mechanism Design to Algorithm Design." In Encyclopedia of Algorithms. Springer New York, 2016. http://dx.doi.org/10.1007/978-1-4939-2864-4_787.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Cai, Yang, Constantinos Daskalakis, and Matthew Weinberg. "Reducing Bayesian Mechanism Design to Algorithm Design." In Encyclopedia of Algorithms. Springer Berlin Heidelberg, 2015. http://dx.doi.org/10.1007/978-3-642-27848-8_787-1.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Parra Pennefather, Patrick. "Remember the Algorithms." In Design Thinking. Apress, 2024. https://doi.org/10.1007/979-8-8688-1061-9_12.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Тези доповідей конференцій з теми "Algorithme Design"

Badi, Manjulata, Sheila Mahapatra, and Saurav Raj. "A SOLUTION OF RPM FOR ACTIVE AND REACTIVE LOADING COMPENSATION." In TOPICS IN INTELLIGENT COMPUTING AND INDUSTRY DESIGN (ICID). Volkson Press, 2022. http://dx.doi.org/10.26480/icpesd.02.2022.135.140.

Повний текст джерела

Анотація:

A solution for Reactive Power Management considering both the active and reactive power loading is obtained by Butterfly Optimization Algorithm (BOA) hybridized to form of Butterfly Optimization Algorithm-Grey Wolf Optimization (BOA-GWO) algorithms. The objective of the research is to optimize the operating cost and power loss for optimum reactive power solution with the proposed combined algorithm and a comparative account with other algorithms depicts the proposed algorithm’s superiority. In view of best result obtained for real power cost reduction is 3.5% and percentage loss as 3.493% with

Стилі APA, Harvard, Vancouver, ISO та ін.

Borjesson, Fredrik, and Katja Hölttä-Otto. "Improved Clustering Algorithm for Design Structure Matrix." In ASME 2012 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. American Society of Mechanical Engineers, 2012. http://dx.doi.org/10.1115/detc2012-70076.

Повний текст джерела

Анотація:

For clustering a large Design Structure Matrix (DSM), computerized algorithms are necessary. A common algorithm by Thebeau uses stochastic hill-climbing to avoid local optima. The output of the algorithm is stochastic, and to be certain a very good clustering solution has been obtained, it may be necessary to run the algorithm thousands of times. To make this feasible in practice, the algorithm must be computationally efficient. Two algorithmic improvements are presented. Together they improve the quality of the results obtained and increase speed significantly for normal clustering problems.

Стилі APA, Harvard, Vancouver, ISO та ін.

Showalter, Mark, Dennis Hong, and Daniel Larimer. "Development and Comparison of Gait Generation Algorithms for Hexapedal Robots Based on Kinematics With Considerations for Workspace." In ASME 2008 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. ASMEDC, 2008. http://dx.doi.org/10.1115/detc2008-49616.

Повний текст джерела

Анотація:

This paper explores the interdependance of walking algorithm and limb workspace for the Multi-Appendage Robotic System (MARS). While MARS is a hexapedal robot, the tasks of defining the workspace and walking agorthm for all six limbs can be abstracted to a single limb using the constraint of a tripedal statically stable gait. Thus, by understanding the behavior of an individual limb, two walking algorithms have been developed which allow MARS to walk on level terain. Both algorithms are adaptive in that they continously update based on control inputs. The differences between the two algorithms

Стилі APA, Harvard, Vancouver, ISO та ін.

Nielsen, David R., and Kazem Kazerounian. "Evolutionary Design of Planar Kinematic Chains." In ASME 1998 Design Engineering Technical Conferences. American Society of Mechanical Engineers, 1998. http://dx.doi.org/10.1115/detc98/mech-5936.

Повний текст джерела

Анотація:

Abstract A procedure is developed to optimize planar mechanism type. A Genetic Algorithm is used to cycle populations of kinematic chain link adjacency matrices, through selection, crossover, and mutation. During this optimization, fit kinematic chains survive while unfit kinematic chains do not. Upon convergence, synthesized kinematic chains of high fitness remain. This technique was lead to be called the Genetic Algorithm for Type Synthesis (GATS). GATS introduces four new ideas for the type synthesis of mechanisms. First, it does not permute all possible kinematic chains. It searches for th

Стилі APA, Harvard, Vancouver, ISO та ін.

Du Pont, Bryony L., and Jonathan Cagan. "An Extended Pattern Search Approach to Wind Farm Layout Optimization." In ASME 2010 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. ASMEDC, 2010. http://dx.doi.org/10.1115/detc2010-28748.

Повний текст джерела

Анотація:

An extended pattern search approach is presented for optimizing the placement of wind turbines on a wind farm. The algorithm will develop a two-dimensional layout for a given number of turbines, employing an objective function that minimizes costs while maximizing the total power production of the farm. The farm cost is developed using an established simplified model that is a function of the number of turbines. The power development of the farm is estimated using an established simplified wake model, which accounts for the aerodynamic effects of turbine blades on downstream wind speed, to whi

Стилі APA, Harvard, Vancouver, ISO та ін.

Khonina, S. N., V. V. Kotlyar, I. V. Nikolsky, S. V. Philippov, and V. A. Soifer. "Iterative Methods for the Kinoforms Synthesis." In International Optical Design Conference. Optica Publishing Group, 1994. http://dx.doi.org/10.1364/iodc.1994.do.251.

Повний текст джерела

Анотація:

Three iterative algorithms for calculating kinoforms are discussed: 1) an algorithm for calculating kinoforms with quantized phase forming radially symmetric images, 2) an algorithm for calculating formers of Gauss-Hermite's and Gauss-Leguerre’s modes in required diffraction orders, 3) an algorithm for calculating formers of reference wavefronts. The results of computer-aided simulation are given.

Стилі APA, Harvard, Vancouver, ISO та ін.

Meng, Joe, Chun (Chuck) Zhang, H. P. Ben Wang, and Yunkui Xiao. "Benchmarking of CMM Form-Fitting Algorithms for Functional Tolerance Analysis." In ASME 1999 Design Engineering Technical Conferences. American Society of Mechanical Engineers, 1999. http://dx.doi.org/10.1115/detc99/dac-8705.

Повний текст джерела

Анотація:

Abstract As the most commonly used computer aided inspection device in precision manufacturing, coordinate measuring machines (CMM’s) have drawn extensive interests from both researchers and practitioners. Different form-fitting algorithms have been developed to process the sampling data gathered by CMM’s. The two most commonly used form-fitting algorithms, the least squares (LS) and the minimum zone (MZ), have caused a lot of controversies in their applications for evaluations of part tolerances and functions. One of the key issues in CMM applications is to study the effectiveness of the algo

Стилі APA, Harvard, Vancouver, ISO та ін.

Borup, Liana, and Alan Parkinson. "Comparison of Four Non-Derivative Optimization Methods on Two Problems Containing Heuristic and Analytic Knowledge." In ASME 1992 Design Technical Conferences. American Society of Mechanical Engineers, 1992. http://dx.doi.org/10.1115/detc1992-0114.

Повний текст джерела

Анотація:

Abstract Hybrid engineering models — models that combine both analytic and heuristic knowledge — can address a wide range of design issues. However, models that combine these two types of information are often non-smooth and thus cannot be optimized by traditional derivative-based optimization algorithms. This paper is a study of four non-derivative optimization methods: Simulated Annealing, Genetic Algorithms, Flexible Polyhedron Search, and Function Approximation. Each algorithm was tested on two engineering problems that combine heuristic and analytic information. The algorithms were then e

Стилі APA, Harvard, Vancouver, ISO та ін.

Lo, Chihsiung, and Panos Y. Papalambros. "A Convex Cutting Plane Algorithm for Global Solution of Generalized Polynomial Optimal Design Models." In ASME 1992 Design Technical Conferences. American Society of Mechanical Engineers, 1992. http://dx.doi.org/10.1115/detc1992-0121.

Повний текст джерела

Анотація:

Abstract Global optimization algorithms for generalized polynomial design models using a global feasible search approach was discussed in a previous article. A new convex cutting plane algorithm (CONCUT) based on global feasible search and with improved performance is presented in this sequel article. Computational results of the CONCUT algorithm compared to one using linear cuts (LINCUT) are given for various test problems. Two design examples, a speed reducer and a corrugated bulkhead design, illustrate the application of the algorithms.

Стилі APA, Harvard, Vancouver, ISO та ін.

Averill, R. C., W. F. Punch, E. D. Goodman, S. C. Lin, Y. C. Yip, and Y. Ding. "Genetic Algorithm-Based Design of Energy Absorbing Laminated Composite Beams." In ASME 1995 Design Engineering Technical Conferences collocated with the ASME 1995 15th International Computers in Engineering Conference and the ASME 1995 9th Annual Engineering Database Symposium. American Society of Mechanical Engineers, 1995. http://dx.doi.org/10.1115/detc1995-0012.

Повний текст джерела

Анотація:

Abstract This paper describes a general approach to structural design using Genetic Algorithms, and an application of that approach to the design of energy absorbing laminated composite beams containing distributed thin, compliant layers. We first discuss a method for applying a Genetic Algorithm (GA) to structural design, using it as an evolutionary search optimizer in conjunction with a structural simulator as its objective function. The simulator used is an efficient and robust special purpose finite element model based on a layerwise laminate theory. The GA “designs” the beam by selecting

Стилі APA, Harvard, Vancouver, ISO та ін.

Звіти організацій з теми "Algorithme Design"

Tipton, Kelley, Brian F. Leas, Emilia Flores, et al. Impact of Healthcare Algorithms on Racial and Ethnic Disparities in Health and Healthcare. Agency for Healthcare Research and Quality (AHRQ), 2023. http://dx.doi.org/10.23970/ahrqepccer268.

Повний текст джерела

Анотація:

Objectives. To examine the evidence on whether and how healthcare algorithms (including algorithm-informed decision tools) exacerbate, perpetuate, or reduce racial and ethnic disparities in access to healthcare, quality of care, and health outcomes, and examine strategies that mitigate racial and ethnic bias in the development and use of algorithms. Data sources. We searched published and grey literature for relevant studies published between January 2011 and February 2023. Based on expert guidance, we determined that earlier articles are unlikely to reflect current algorithms. We also hand-se

Стилі APA, Harvard, Vancouver, ISO та ін.

Pirohov, Vladyslav M., Anna M. Horlo, and Iryna S. Mintii. Software development of the algorithm of adaptating of the website design for people with color-blindness. [б. в.], 2018. http://dx.doi.org/10.31812/123456789/2888.

Повний текст джерела

Анотація:

The purpose of the study is the program implementation of the basic algorithms of the website design adaptation for people with color perception. This article examines the implementation of the following algorithms: the conversion algorithm from the rgb color model to the lms model (there is a special algorithm precisely in the color model lms for modeling various types of color perception violations), simulation of different color blindness types in the lms-model (this is the transformation of normal values in the color model lms to values with different types of color perception violations),

Стилі APA, Harvard, Vancouver, ISO та ін.

Baader, Franz, Jan Hladik, and Rafael Peñaloza. PSpace Automata with Blocking for Description Logics. Aachen University of Technology, 2006. http://dx.doi.org/10.25368/2022.157.

Повний текст джерела

Анотація:

In Description Logics (DLs), both tableau-based and automatabased algorithms are frequently used to show decidability and complexity results for basic inference problems such as satisfiability of concepts. Whereas tableau-based algorithms usually yield worst-case optimal algorithms in the case of PSpace-complete logics, it is often very hard to design optimal tableau-based algorithms for ExpTime-complete DLs. In contrast, the automata-based approach is usually well-suited to prove ExpTime upper-bounds, but its direct application will usually also yield an ExpTime-algorithm for a PSpace-complet

Стилі APA, Harvard, Vancouver, ISO та ін.

Cordeiro de Amorim, Renato. A survey on feature weighting based K-Means algorithms. Web of Open Science, 2020. http://dx.doi.org/10.37686/ser.v1i2.79.

Повний текст джерела

Анотація:

In a real-world data set there is always the possibility, rather high in our opinion, that different features may have different degrees of relevance. Most machine learning algorithms deal with this fact by either selecting or deselecting features in the data preprocessing phase. However, we maintain that even among relevant features there may be different degrees of relevance, and this should be taken into account during the clustering process. With over 50 years of history, K-Means is arguably the most popular partitional clustering algorithm there is. The first K-Means based clustering algo

Стилі APA, Harvard, Vancouver, ISO та ін.

Striuk, Andrii, Olena Rybalchenko, and Svitlana Bilashenko. Development and Using of a Virtual Laboratory to Study the Graph Algorithms for Bachelors of Software Engineering. [б. в.], 2020. http://dx.doi.org/10.31812/123456789/4462.

Повний текст джерела

Анотація:

The paper presents an analysis of the importance of studying graph algorithms, the reasons for the need to implement this project and its subsequent use. The existing analogues analysis is carried out, due to which a list of advantages and disadvantages is formed and taken into account in developing the virtual laboratory. A web application is created that clearly illustrates the work of graph algorithms, such as Depth-First Search, Dijkstra’s Shortest Path, Floyd- Warshall, Kruskal Minimum Cost Spanning Tree Algorithm. A simple and user- friendly interface is developed and it is supported by

Стилі APA, Harvard, Vancouver, ISO та ін.

BALLISTIC MISSILE OFFICE NORTON AFB CA. Design for Producibility. A Design Producibility Algorithm. Defense Technical Information Center, 1990. http://dx.doi.org/10.21236/ada241418.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Lewis, Dustin, ed. A Compilation of Materials Apparently Reflective of States’ Views on International Legal Issues pertaining to the Use of Algorithmic and Data-reliant Socio-technical Systems in Armed Conflict. Harvard Law School Program on International Law and Armed Conflict, 2020. http://dx.doi.org/10.54813/cawz3627.

Повний текст джерела

Анотація:

This document is a compilation of materials that at least appear to be reflective of one or more states’ views on international legal issues pertaining to the actual or possible use of algorithmic and data-reliant socio-technical systems in armed conflict. In September of 2018, the Harvard Law School Program on International Law and Armed Conflict (HLS PILAC) commenced a project titled “International Legal and Policy Dimensions of War Algorithms: Enduring and Emerging Concerns.”[1] The project builds on the program’s earlier research and policy initiative on war-algorithm accountability. A goa

Стилі APA, Harvard, Vancouver, ISO та ін.

Ullman, Jeffrey D. Design and Implementation of Parallel Algorithms. Defense Technical Information Center, 1992. http://dx.doi.org/10.21236/ada250894.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Smith, Douglas R. Theory of Algorithm Structure and Design. Defense Technical Information Center, 1992. http://dx.doi.org/10.21236/ada257948.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Farhi, Edward, Jeffrey Goldstone, and Peter Shor. Design of Quantum Algorithms Using Physics Tools. Defense Technical Information Center, 2014. http://dx.doi.org/10.21236/ada605648.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Ми пропонуємо знижки на всі преміум-плани для авторів, чиї праці увійшли до тематичних добірок літератури. Зв'яжіться з нами, щоб отримати унікальний промокод!