Добірка наукової літератури з теми "Algorithmes ad"
Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями
Ознайомтеся зі списками актуальних статей, книг, дисертацій, тез та інших наукових джерел на тему "Algorithmes ad".
Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.
Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.
Статті в журналах з теми "Algorithmes ad":
Merz, Evan. "Implications of Ad Hoc Artificial Intelligence in Music." Proceedings of the AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment 10, no. 5 (June 29, 2021): 35–39. http://dx.doi.org/10.1609/aiide.v10i5.12763.
Cromer, Sara J., Victoria Chen, Christopher Han, William Marshall, Shekina Emongo, Evelyn Greaux, Tim Majarian, Jose C. Florez, Josep Mercader, and Miriam S. Udler. "Algorithmic identification of atypical diabetes in electronic health record (EHR) systems." PLOS ONE 17, no. 12 (December 12, 2022): e0278759. http://dx.doi.org/10.1371/journal.pone.0278759.
Ma, Renkai, and Yubo Kou. ""How advertiser-friendly is my video?": YouTuber's Socioeconomic Interactions with Algorithmic Content Moderation." Proceedings of the ACM on Human-Computer Interaction 5, CSCW2 (October 13, 2021): 1–25. http://dx.doi.org/10.1145/3479573.
Poselentseva, D. Yu, and E. B. Zamyatina. "An experience of routing algorithms and a data transfer algorithms using simulation." Вестник Пермского университета. Математика. Механика. Информатика, no. 4 (47) (2019): 76–85. http://dx.doi.org/10.17072/1993-0550-2018-4-76-85.
Bessa, Maria. "Algorithmic Design." Architectural Design 79, no. 1 (January 2009): 120–23. http://dx.doi.org/10.1002/ad.831.
Register, Yim, and Emma S. Spiro. "Developing Self-Advocacy Skills through Machine Learning Education: The Case of Ad Recommendation on Facebook." Proceedings of the International AAAI Conference on Web and Social Media 16 (May 31, 2022): 817–28. http://dx.doi.org/10.1609/icwsm.v16i1.19337.
Pawan, Kumar Verma, Gupta Tarun, Rakesh Nitin, and Nitin Nitin. "A Mobile Ad-Hoc Routing Algorithm with Comparative Study of Earlier Proposed Algorithms." International Journal of Communications, Network and System Sciences 03, no. 03 (2010): 289–93. http://dx.doi.org/10.4236/ijcns.2010.33037.
Paik, Ji Woong, Jong-Mann Kim, and Joon-Ho Lee. "Performance Improvement of AD-MUSIC Algorithm Using Newton Iteration." Journal of Korean Institute of Electromagnetic Engineering and Science 28, no. 11 (November 2017): 880–85. http://dx.doi.org/10.5515/kjkiees.2017.28.11.880.
Taniguchi, Hirohito, Michiko Inoue, Toshimitsu Masuzawa, and Hideo Fujiwara. "Clustering algorithms in ad hoc networks." Electronics and Communications in Japan (Part II: Electronics) 88, no. 1 (2004): 51–59. http://dx.doi.org/10.1002/ecjb.20143.
Pestin, Maxim S., and Alexander S. Novikov. "Simulation model of wireless ad-hoc network to study algorithms of traffic routing." Journal Of Applied Informatics 17, no. 4 (August 31, 2022): 75–86. http://dx.doi.org/10.37791/2687-0649-2022-17-4-75-86.
Дисертації з теми "Algorithmes ad":
Bessaoud, Karim. "Algorithmes auto-stabilisants pour les réseaux ad hoc." Versailles-St Quentin en Yvelines, 2013. http://www.theses.fr/2013VERS0048.
In this thesis, we propose three self-stabilizing algorithms for ad hoc wireless networks. The first one is an algorithm that builds a low weight connected dominating set, called backbone. The backbone is used to create a logical infrastructure in an ad hoc network. We show by simulation the efficiency of this algorithm in different contexts according to the semantics given to the weight of the nodes : the backbone may contain for instance the least mobile nodes or nodes with the highest battery level. The two other algorithms deal with energy conservation in wireless sensor networks. We propose two solutions based on topology control by reducing transmission powers, each one dedicated to a type of communication used by the sensors : communication between any pair of sensors or by diffusion. The proposed algorithms are formally proven and evaluated by simulation
Guizani, Badreddine. "algorithmes de clustérisation et routage dans les réseaux Ad Hoc." Phd thesis, Université de Technologie de Belfort-Montbeliard, 2012. http://tel.archives-ouvertes.fr/tel-00703257.
Bricard-Vieu, Vincent. "Contrôle de topologie et qualité de service dans les réseaux ad hoc." Dijon, 2005. http://www.theses.fr/2005DIJOS056.
This thesis deals with clustering and quality of service in mobile ad hoc networks. Node mobility in such networks induces a highly dynamical topology. Robust routing protocols are then required and organization of nodes is needed. Many clustering algorithms were proposed in the literature, consisting of phases of election of cluster-heads and construction of clusters, and phases of maintenance to preserve the stability of the hierarchy. However, that algorithms generate a significant overhead, damaging the performances. To improve these performances, we propose in this thesis, algorithms consisting of spacing the signalling messages sent by the cluster-head and replacing them by an estimate of its location. Moreover, some of our algorithms propose a local election, more efficient than a global one. Using the network simulator GloMoSim, simulations are conducted to evaluate our algorithm performances and compare them with existing ones
Canourgues, Lucile. "Algorithmes de routage dans les réseaux mobile ad hoc tactique à grande échelle." Toulouse, INPT, 2008. http://ethesis.inp-toulouse.fr/archive/00000595/.
The current Transformation of the military networks adopts the MANET as a main component of the tactical domain. Indeed, a MANET is the right solution to enable highly mobile, highly reactive and quickly deployable tactical networks. Many applications such as the Situational Awareness rely on group communications, underlying the need for a multicast service with the tactical environment where the MANET is employed as a transit network. The purpose of this thesis is to study the setting up of an optimal multicast service within this tactical environment. We firstly focus on defining the protocol architecture to carry out within the tactical network paying particular attention to the MANET. This network is interconnected within different types of networks based on IP technologies and implementing potentially heterogeneous multicast protocols. The tactical MANET is supposed to be made of several hundred of mobile nodes, which implies that the scalability is crucial in the multicast protocol architecture choice. Since the concept of clustering proposes interesting scalability features, we consider that the MANET is a clustered network. Thereby, we define two multicast routing protocols adapted to the MANET: firstly STAMP that is in charge of the multicast communications within each cluster and secondly SAFIR that handles multicast flows between the clusters. These two protocols that can be implemented independently, act in concert to provide an efficient and scalable multicast service for the tactical MANET
Canourgues, Lucile Beylot André-Luc. "Algorithmes de routage dans les réseaux mobile ad hoc tactique à grande échelle." Toulouse : INP Toulouse, 2008. http://ethesis.inp-toulouse.fr/archive/00000595.
Drira, Kaouther. "Coloration d’arêtes ℓ-distance et clustering : études et algorithmes auto-stabilisants". Thesis, Lyon 1, 2010. http://www.theses.fr/2010LYO10335/document.
Graph coloring is a famous combinatorial optimization problem and is very attractive for its numerous applications. Many variants and generalizations of the graph-coloring problem have been introduced and studied. An edge-coloring assigns a color to each edge so that no two adjacent edges share the same color. In the first part of this thesis, we study the problem of the ℓ-distance-edge-coloring, which is a generalization of the classical edge-coloring. The study focuses on the following classes of graphs : paths, grids, hypercubes, trees and some power graphs. We are conducting a combinatorial and algorithmic study of the parameter. We give a sequential coloring algorithm for each class of graph. The ℓ-distance-edge-coloring is especially considered in large-scale networks. However, with the increasing number of nodes, networks are increasingly vulnerable to faults. In the second part, we focus on fault-tolerant algorithms and in particular self-stabilizing algorithms. We propose a self-stabilizing algorithm for proper edge-coloring. Our solution is based on Vizing’s result to minimize number of colors. Subsequently, we propose a selfstabilizing clustering algorithm for applications in the field of security in mobile ad hoc networks. Our solution is a partitioning into clusters based on trust relationships between nodes. We also propose a group key-management algorithm in mobile ad hoc networks based on the topology of clusters previously built. The security of our protocol is strengthened by its clustering criterion which constantly monitors trust relationships and expels malicious nodes out of the multicast session
Gawedzki, Ignacy. "Algorithmes distribués pour la sécurité et la qualité de service dans les réseaux ad hoc mobiles." Paris 11, 2008. http://www.theses.fr/2008PA112240.
Currently available routing protocols for ad hoc networks assume the total absence of malicious participants, although this assumption is seldom true in practical applications. In this work, we look for a way to augment proactive protocols so as to let nodes watch over the network in a distributed fashion and measure the threat represented by every node. The measurement is used to extract a quality of service metric used in turn by the routing protocol to avoid the most suspected nodes, according to all the implemented detection methods. We propose to detect data packet loss, be it intentional or not. The detection is performed by a verification of the principle of flow conservation, based on the exchange of packet counters between neighbors. A scalable method of diffusion of these values is also proposed. The actual checking is used to maintain a local degree of distrust which is diffused in all the network and recombined by the nodes into a global metric of distrust in each node. The application to the OLSR protocol is described and its performance evaluated by simulation. We show that the solution is efficient and that the impact of the control overhead on the medium capacity remains low. Finally, an experimental platform of OLSR with quality of service and security is presented, which is aimed at making our solutions work in an actual real setup in order to reveal any potential problem that may appear with the use of commercial off-the-shelf hardware
Drira, Kaouther. "Coloration d'arêtes ℓ-distance et clustering : études et algorithmes auto-stabilisants". Phd thesis, Université Claude Bernard - Lyon I, 2010. http://tel.archives-ouvertes.fr/tel-00736580.
Hauspie, Michaël. "Contributions à l'étude des gestionnaires de services distribués dans les réseaux ad hoc." Phd thesis, Université des Sciences et Technologie de Lille - Lille I, 2005. http://tel.archives-ouvertes.fr/tel-00656359.
Sahin, Serdar. "Advanced receivers for distributed cooperation in mobile ad hoc networks." Thesis, Toulouse, INPT, 2019. http://www.theses.fr/2019INPT0089.
Mobile ad hoc networks (MANETs) are rapidly deployable wireless communications systems, operating with minimal coordination in order to avoid spectral efficiency losses caused by overhead. Cooperative transmission schemes are attractive for MANETs, but the distributed nature of such protocols comes with an increased level of interference, whose impact is further amplified by the need to push the limits of energy and spectral efficiency. Hence, the impact of interference has to be mitigated through with the use PHY layer signal processing algorithms with reasonable computational complexity. Recent advances in iterative digital receiver design techniques exploit approximate Bayesian inference and derivative message passing techniques to improve the capabilities of well-established turbo detectors. In particular, expectation propagation (EP) is a flexible technique which offers attractive complexity-performance trade-offs in situations where conventional belief propagation is limited by computational complexity. Moreover, thanks to emerging techniques in deep learning, such iterative structures are cast into deep detection networks, where learning the algorithmic hyper-parameters further improves receiver performance. In this thesis, EP-based finite-impulse response decision feedback equalizers are designed, and they achieve significant improvements, especially in high spectral efficiency applications, over more conventional turbo-equalization techniques, while having the advantage of being asymptotically predictable. A framework for designing frequency-domain EP-based receivers is proposed, in order to obtain detection architectures with low computational complexity. This framework is theoretically and numerically analysed with a focus on channel equalization, and then it is also extended to handle detection for time-varying channels and multiple-antenna systems. The design of multiple-user detectors and the impact of channel estimation are also explored to understand the capabilities and limits of this framework. Finally, a finite-length performance prediction method is presented for carrying out link abstraction for the EP-based frequency domain equalizer. The impact of accurate physical layer modelling is evaluated in the context of cooperative broadcasting in tactical MANETs, thanks to a flexible MAC-level simulator
Книги з теми "Algorithmes ad":
Wagner, Dorothea, and Roger Wattenhofer, eds. Algorithms for Sensor and Ad Hoc Networks. Berlin, Heidelberg: Springer Berlin Heidelberg, 2007. http://dx.doi.org/10.1007/978-3-540-74991-2.
Dorronsoro, Bernabé, Patricia Ruiz, Grégoire Danoy, Yoann Pigné, and Pascal Bouvry. Evolutionary Algorithms for Mobile Ad Hoc Networks. Hoboken, NJ: John Wiley & Sons, Inc., 2014. http://dx.doi.org/10.1002/9781118833209.
Dhillon, Santpal Singh. Ant routing, searching and topology estimation algorithms for ad hoc netwoks. Amsterdam: IOS Press, 2008.
Dhillon, Santpal Singh. Ant routing, searching and topology estimation algorithms for ad hoc netwoks. Amsterdam: IOS Press, 2008.
Azzedine, Boukerche, ed. Algorithms and protocols for wireless, mobile ad hoc networks. Hoboken, N.J: Wiley Interscience, 2008.
Boukerche, Azzedine, ed. Algorithms and Protocols for Wireless and Mobile Ad Hoc Networks. Hoboken, NJ, USA: John Wiley & Sons, Inc., 2008. http://dx.doi.org/10.1002/9780470396384.
Makki, S. Kami. Sensor and Ad-Hoc Networks: Theoretical and Algorithmic Aspects. Boston, MA: Springer Science+Business Media, LLC, 2008.
Nikoletseas, Sotiris, Yuanyuan Yang, and Apostolos Georgiadis, eds. Wireless Power Transfer Algorithms, Technologies and Applications in Ad Hoc Communication Networks. Cham: Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-46810-5.
Dohler, Mischa. Cooperative communications: Hardware, channel & PHY. Chichester, West Sussex, U.K: Wiley, 2010.
Siomina, Iana. Radio network planning and resource optimization: Mathematical models and algorithms for UMTS, WLANs, and ad hoc networks. Norrko ping: Department of Science and Technology, Linko ping University, 2007.
Частини книг з теми "Algorithmes ad":
Kao, Ming-Yang. "Ad-Hoc Networks." In Encyclopedia of Algorithms, 7. Boston, MA: Springer US, 2008. http://dx.doi.org/10.1007/978-0-387-30162-4_3.
Dvořák, Wolfgang, and Monika Henzinger. "Online Ad Assignment with an Ad Exchange." In Approximation and Online Algorithms, 156–67. Cham: Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-18263-6_14.
Wang, Liang, and Jianxin Zhao. "Algorithmic Differentiation." In Architecture of Advanced Numerical Analysis Systems, 49–85. Berkeley, CA: Apress, 2022. http://dx.doi.org/10.1007/978-1-4842-8853-5_3.
Fu, Hu, Patrick Jordan, Mohammad Mahdian, Uri Nadav, Inbal Talgam-Cohen, and Sergei Vassilvitskii. "Ad Auctions with Data." In Algorithmic Game Theory, 168–79. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-33996-7_15.
Alaei, Saeed, Mohammad T. Hajiaghayi, Vahid Liaghat, Dan Pei, and Barna Saha. "AdCell: Ad Allocation in Cellular Networks." In Algorithms – ESA 2011, 311–22. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-23719-5_27.
Tadjouddine, Mohamed, Shaun A. Forth, and John D. Pryce. "AD Tools and Prospects for Optimal AD in CFD Flux Jacobian Calculations." In Automatic Differentiation of Algorithms, 255–61. New York, NY: Springer New York, 2002. http://dx.doi.org/10.1007/978-1-4613-0075-5_30.
Giering, Ralf, and Thomas Kaminski. "Recomputations in Reverse Mode AD." In Automatic Differentiation of Algorithms, 283–91. New York, NY: Springer New York, 2002. http://dx.doi.org/10.1007/978-1-4613-0075-5_33.
Che, Fei, Errol L. Lloyd, and Liang Zhao. "Improved Topology Control Algorithms for Simple Mobile Networks." In Ad Hoc Networks, 450–65. Berlin, Heidelberg: Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-11723-7_30.
Kučera, Luděk. "Low Degree Connectivity in Ad-Hoc Networks." In Algorithms – ESA 2005, 203–14. Berlin, Heidelberg: Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11561071_20.
Kao, Ming-Yang. "Multi-Hop Radio Networks, Ad Hoc Networks." In Encyclopedia of Algorithms, 562. Boston, MA: Springer US, 2008. http://dx.doi.org/10.1007/978-0-387-30162-4_248.
Тези доповідей конференцій з теми "Algorithmes ad":
Tang, Shaojie. "Robust Advertisement Allocation." In 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/617.
Ali, Muhammad, Piotr Sapiezynski, Aleksandra Korolova, Alan Mislove, and Aaron Rieke. "Ad Delivery Algorithms." In WSDM '21: The Fourteenth ACM International Conference on Web Search and Data Mining. New York, NY, USA: ACM, 2021. http://dx.doi.org/10.1145/3437963.3441801.
Ravula, Manish, Shani Alkoby, and Peter Stone. "Ad Hoc Teamwork With Behavior Switching Agents." In 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/78.
Mayer, Dirk, Sven Herold, and Holger Hanselka. "Application of Kautz Models for Adaptive Vibration Control." In ASME 2001 International Mechanical Engineering Congress and Exposition. American Society of Mechanical Engineers, 2001. http://dx.doi.org/10.1115/imece2001/ad-23725.
Török, Attila, Péter Laborczi, and Balázs Mezny. "Spatial Context-Awareness in Vehicular Ad Hoc Networks." In 2009 10th International Symposium on Pervasive Systems, Algorithms, and Networks. IEEE, 2009. http://dx.doi.org/10.1109/i-span.2009.93.
Jha, Ratneshwar, and Chengli He. "Design and Experimental Validation of Adaptive Neurocontroller for Beam Vibration Suppression Using Piezoelectric Actuators." In ASME 2001 International Mechanical Engineering Congress and Exposition. American Society of Mechanical Engineers, 2001. http://dx.doi.org/10.1115/imece2001/ad-23731.
Qidwai, Muhammad A., Virginia G. DeGiorgi, and Rick K. Everett. "Image-Based Modeling of Dynamic Porous SMA Behavior." In ASME 2001 International Mechanical Engineering Congress and Exposition. American Society of Mechanical Engineers, 2001. http://dx.doi.org/10.1115/imece2001/ad-23729.
de Carvalho Pinheiro, Henrique, Francesco Russo, Lorenzo Sisca, Alessandro Messana, Davide De Cupis, Alessandro Ferraris, Andrea Giancarlo Airale, and Massimiliana Carello. "Advanced Vehicle Dynamics Through Active Aerodynamics and Active Body Control." In 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-22290.
Zaccone, R., and M. Martelli. "A random sampling based algorithm for ship path planning with obstacles." In International Ship Control Systems Symposium. IMarEST, 2018. http://dx.doi.org/10.24868/issn.2631-8741.2018.018.
Tsai, Hua-Wen, Tzung-Shi Chen, and Sheng-Kai Lin. "Dissemination of Data Aggregation in Vehicular Ad Hoc Networks." In 2009 10th International Symposium on Pervasive Systems, Algorithms, and Networks. IEEE, 2009. http://dx.doi.org/10.1109/i-span.2009.34.
Звіти організацій з теми "Algorithmes ad":
Sharma, Sushant, Yi Shi, Y. T. Hou, and Sastry Kompella. An Optimal Algorithm for Relay Node Assignment in Cooperative Ad Hoc Networks. Fort Belvoir, VA: Defense Technical Information Center, January 2010. http://dx.doi.org/10.21236/ada536094.