Relevant bibliographies by topics / Algorithmes ad

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers
  6. Reports

Academic literature on the topic 'Algorithmes ad'

Author: Grafiati
Published: 1 February 2023

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Algorithmes ad.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Algorithmes ad"

1

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.

Full text
Abstract:
This paper is an examination of several well-known applications of artificial intelligence in music generation. The algorithms in EMI, GenJam, WolframTones, and Swarm Music are examined in pursuit of ad hoc modifications. Based on these programs, it is clear that ad hoc modifications occur in most algorithmic music programs. We must keep this in mind when generalizing about computational creativity based on these programs. Ad hoc algorithms model a specific task, rather than a general creative algorithm. The musical metacreation discourse could benefit from the skepticism of the procedural content practitioners at AIIDE.
APA, Harvard, Vancouver, ISO, and other styles
2

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.

Full text
Abstract:
Aims Understanding atypical forms of diabetes (AD) may advance precision medicine, but methods to identify such patients are needed. We propose an electronic health record (EHR)-based algorithmic approach to identify patients who may have AD, specifically those with insulin-sufficient, non-metabolic diabetes, in order to improve feasibility of identifying these patients through detailed chart review. Methods Patients with likely T2D were selected using a validated machine-learning (ML) algorithm applied to EHR data. “Typical” T2D cases were removed by excluding individuals with obesity, evidence of dyslipidemia, antibody-positive diabetes, or cystic fibrosis. To filter out likely type 1 diabetes (T1D) cases, we applied six additional “branch algorithms,” relying on various clinical characteristics, which resulted in six overlapping cohorts. Diabetes type was classified by manual chart review as atypical, not atypical, or indeterminate due to missing information. Results Of 114,975 biobank participants, the algorithms collectively identified 119 (0.1%) potential AD cases, of which 16 (0.014%) were confirmed after expert review. The branch algorithm that excluded T1D based on outpatient insulin use had the highest percentage yield of AD (13 of 27; 48.2% yield). Together, the 16 AD cases had significantly lower BMI and higher HDL than either unselected T1D or T2D cases identified by ML algorithms (P<0.05). Compared to the ML T1D group, the AD group had a significantly higher T2D polygenic score (P<0.01) and lower hemoglobin A1c (P<0.01). Conclusion Our EHR-based algorithms followed by manual chart review identified collectively 16 individuals with AD, representing 0.22% of biobank enrollees with T2D. With a maximum yield of 48% cases after manual chart review, our algorithms have the potential to drastically improve efficiency of AD identification. Recognizing patients with AD may inform on the heterogeneity of T2D and facilitate enrollment in studies like the Rare and Atypical Diabetes Network (RADIANT).
APA, Harvard, Vancouver, ISO, and other styles
3

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.

Full text
Abstract:
To manage user-generated harmful video content, YouTube relies on AI algorithms (e.g., machine learning) in content moderation and follows a retributive justice logic to punish convicted YouTubers through demonetization, a penalty that limits or deprives them of advertisements (ads), reducing their future ad income. Moderation research is burgeoning in CSCW, but relatively little attention has been paid to the socioeconomic implications of YouTube's algorithmic moderation. Drawing from the lens of algorithmic labor, we describe how algorithmic moderation shapes YouTubers' labor conditions through algorithmic opacity and precarity. YouTubers coped with such challenges from algorithmic moderation by sharing and applying practical knowledge they learned about moderation algorithms. By analyzing video content creation as algorithmic labor, we unpack the socioeconomic implications of algorithmic moderation and point to necessary post-punishment support as a form of restorative justice. Lastly, we put forward design considerations for algorithmic moderation systems.
APA, Harvard, Vancouver, ISO, and other styles
4

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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Bessa, Maria. "Algorithmic Design." Architectural Design 79, no. 1 (January 2009): 120–23. http://dx.doi.org/10.1002/ad.831.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

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.

Full text
Abstract:
Facebook users interact with algorithms every day. These algorithms can perpetuate harm via incongruent targeted ads, echo chambers, or "rabbit hole" recommendations. Education around the machine learning (ML) behind Facebook (FB) can help users to point out algorithmic bias and harm, and advocate for themselves effectively when things go wrong. One algorithm that FB users interact with regularly is User-Based Collaborative Filtering (UB-CF) which provides the basis for ad recommendation. We contribute a novel research approach for teaching users about a commonly used algorithm in machine learning in real-world context -- an instructive web application using real examples built from the user's own FB data on ad interests. The instruction also prompts users to reflect on their interactions with ML systems, specifically Facebook. In a between-subjects design, we tested both Data Science Novices and Experts on the efficacy of the UB-CF instruction. Taking care to highlight the voices of marginalized users, we use the application as a prompt for surfacing potential harms perpetuated by FB ad recommendations, and qualitatively analyze themes of harm and proposed solutions provided by users themselves. The instruction increased comprehension of UB-CF for both groups, and we show that comprehension is associated with mentioning the mechanisms of the algorithm more in advocacy statements, a crucial component of a successful argument. We provide recommendations for increased algorithmic transparency on social media and for including marginalized voices in the conversation of algorithmic harm that are of interest both to social media researchers and ML educators.
APA, Harvard, Vancouver, ISO, and other styles
7

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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

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.

Full text
Abstract:
Communication network simulators are software designed to model, explore, test and debug network technologies, including wireless decentralized self-organizing networks or ad-hoc networks. They greatly simplify the research, development and optimization of routing protocols in these networks. However, the well-known simulators have a number of disadvantages, including the difficulty of adding custom extensions to ad-hoc network routing protocols, the lack of the necessary network stack, the lack of routing algorithm visualization modes, low performance, and difficulty in debugging communication protocols. The purpose of this work is to create a simulation model of a wireless network that would allow us to explore, debug and evaluate the developed algorithms and routing protocols for ad-hoc networks. At the same time, the requirements for interface ergonomics and the ability to visualize the operation of algorithms, ensure the collection of statistics, and create various scenarios for the operation of the network come to the fore. The article proposes the structure of the simulation model, which includes the modules of the network subscriber, application software, network layer of the OSI data transmission model, radio module, radio transmission environment, statistics collection, visualization and scenario management. To solve the tasks set, the approach of discrete-event modeling was used. To create a simulator of wireless decentralized networks and routing algorithms, a set of classes was developed that implement the modules of the simulation model. Based on the proposed structure, module classes and discrete event simulation algorithm, a software implementation of the simulation model was created using the C++ programming language and the Qt framework. The developed simulation model was used in the course of an experimental study of the effectiveness of the network routing algorithm. The proposed software will simplify the development and debugging of algorithms and routing protocols for ad-hoc networks.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Algorithmes ad"

1

Bessaoud, Karim. "Algorithmes auto-stabilisants pour les réseaux ad hoc." Versailles-St Quentin en Yvelines, 2013. http://www.theses.fr/2013VERS0048.

Full text
Abstract:
Dans cette thèse, nous proposons trois algorithmes auto-stabilisants pour les réseaux ad hoc sans fil. Le premier est un algorithme de construction d’un ensemble connexe dominant de poids faible, appelé backbone. Le backbone est utilisé pour créer une infrastructure logique dans un réseau ad hoc. Nous avons montré par simulation l’efficacité de cet algorithme dans différents contextes selon la sémantique donnée aux poids des nœuds : le backbone pouvant contenir par exemple les nœuds les plus chargés en énergie ou les moins mobiles. Les deux autres algorithmes traitent de l’économie d’énergie dans les réseaux de capteurs. Nous proposons deux solutions basées sur le contrôle de la topologie à travers la réduction des puissances de transmission, chacune dédié à un type de communication utilisé par les capteurs : communication entre tout couple de capteurs ou par diffusion. Tous les algorithmes présentés sont prouvés formellement et évalués par simulation
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
APA, Harvard, Vancouver, ISO, and other styles
2

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.

Full text
Abstract:
Le passage à l'échelle des protocoles de routage est un des problèmes les plus critiques pour les réseauxmobiles sans fil à grande envergure. Dans ce cadre, le concept de clusterisation peut être mis à profit dans lafonction de routage afin d'améliorer les performances de ces réseaux. En premier lieu, cette thèse présentenotre algorithme de clusterisation à 1-saut alpha-SSCA (α-Stability Structure Clustering Algorithm) qui apour objectif d'améliorer la stabilité de la structure des clusters. Un algorithme générique de clusterisationà K-sauts est également proposé en ayant le même but de stabilité visé par alpha-SSCA tout en réduisant lenombre de clusters générés et en étant indépendant de la métrique d'élection des cluster-heads. Ensuite, nousprésentons notre proposition d'un protocole de routage à état des liens des clusters qui exploite les apports denotre mécanisme de clusterisation α-SSCA. Ce protocole, appelé CLSR (Cluster-based Link State Routing),vise à réduire le trafic de contrôle afin d'améliorer les performances du réseau à large échelle. Nous avonsproposé aussi une version hiérarchique du protocole CLSR. Ce protocole de routage introduit une hiérarchiedans la structure des clusters qui permet de réduire le nombre de clusters en groupement des clusters prochesdans un même cluster. L'objectif principal de ce protocole hiérarchique est d'améliorer la scalabilité de CLSRquand le nombre de noeuds dans le réseau augmente considérablement.
APA, Harvard, Vancouver, ISO, and other styles
3

Bricard-Vieu, Vincent. "Contrôle de topologie et qualité de service dans les réseaux ad hoc." Dijon, 2005. http://www.theses.fr/2005DIJOS056.

Full text
Abstract:
Cette thèse traite du contrôle de topologie (clustering) et de la qualité de service dans les réseaux ad hoc. Ces réseaux nécessitant des protocoles de routage robustes aux changements de topologie dus à la mobilité des nœuds, il faut les structurer. Les algorithmes de clustering proposés dans la littérature consistent à alterner des phases d'élection de chefs et de mise en grappe des nœuds avec des phases de maintenance pour garder une hiérarchie stable. Cependant, ils génèrent un gaspillage important, dégradant les performances. Pour améliorer celles-ci nous proposons dans cette thèse des algorithmes consistant à espacer les messages de signalisation envoyés par le chef et à estimer sa position à la place. De plus, certains de nos algorithmes proposent une élection locale des chefs, moins coûteuse qu'une élection globale. A l'aide du logiciel GloMoSim, nous réalisons des simulations pour évaluer les performances de nos algorithmes et les comparer avec celles d'autres algorithmes
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
APA, Harvard, Vancouver, ISO, and other styles
4

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/.

Full text
Abstract:
La Transformation qui s'opère depuis quelques années dans les réseaux militaires place le MANET comme une composante principale du domaine tactique. En effet, un MANET met en œuvre des nœuds de communication de grande mobilité, de grande réactivité et qui se déploient rapidement. De nombreuses applications militaires temps réel (ex : "situational awarness") reposent sur des communications de groupes et nécessitent donc l'existence d'un service multicast dans l'environnement tactique où le MANET est utilisé comme réseau de transit. L'objectif de cette thèse est d'étudier la mise en place d'un service multicast optimum dans l'environnement tactique MANET. Nous nous sommes premièrement attachés à définir l'architecture protocolaire multicast à déployer au sein du réseau tactique et plus particulièrement dans le MANET. Le MANET tactique est supposé être composé de plusieurs centaines de nœuds, ce qui implique que la contrainte de passage à l'échelle est déterminante dans le choix de l'architecture protocolaire du service multicast. Nous avons choisi le clustering comme solution de passage à l'échelle. Nous avons alors défini deux protocoles de routage multicast adaptés au MANET: STAMP, chargé des communications multicast à l'intérieur de chaque cluster et SAFIR, chargé des flux multicast entre les clusters. Ces deux protocoles agissent de concert pour fournir un service multicast performant et supportant le passage à l'échelle dans le MANET tactique. [. . . ]
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
APA, Harvard, Vancouver, ISO, and other styles
5

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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Drira, Kaouther. "Coloration d’arêtes ℓ-distance et clustering : études et algorithmes auto-stabilisants." Thesis, Lyon 1, 2010. http://www.theses.fr/2010LYO10335/document.

Full text
Abstract:
La coloration de graphes est un problème central de l’optimisation combinatoire. C’est un domaine très attractif par ses nombreuses applications. Différentes variantes et généralisations du problème de la coloration de graphes ont été proposées et étudiées. La coloration d’arêtes d’un graphe consiste à attribuer une couleur à chaque arête du graphe de sorte que deux arêtes ayant un sommet commun n’ont jamais la même couleur, le tout en utilisant le moins de couleurs possibles. Dans la première partie de cette thèse, nous étudions le problème de la coloration d’arêtes ℓ-distance, qui est une généralisation de la coloration d’arêtes classique. Nous menons une étude combinatoire et algorithmique du paramètre. L’étude porte sur les classes de graphes suivantes : les chaines, les grilles, les hypercubes, les arbres et des graphes puissances. Le paramètre de la coloration d’arêtes ℓ-distance permet de modéliser des problèmes dans des réseaux assez grands. Cependant, avec la multiplication du nombre de nœuds, les réseaux sont de plus en plus vulnérables aux défaillances (ou pannes). Dans la deuxième partie, nous nous intéressons aux algorithmes tolérants aux pannes et en particulier les algorithmes auto-stabilisants. Nous proposons un algorithme auto-stabilisant pour la coloration propre d’arêtes. Notre solution se base sur le résultat de vizing pour utiliser un minimum de couleurs possibles. Par la suite, nous proposons un algorithme auto-stabilisant de clustering destine a des applications dans le domaine de la sécurité dans les réseaux mobiles Ad hoc. La solution que nous proposons est un partitionnement en clusters base sur les relations de confiance qui existent entre nœuds. Nous proposons aussi un algorithme de gestion de clés de groupe dans les réseaux mobiles ad hoc qui s’appuie sur la topologie de clusters préalablement construite. La sécurité de notre protocole est renforcée par son critère de clustering qui surveille en permanence les relations de confiance et expulse les nœuds malveillants de la session de diffusion
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
APA, Harvard, Vancouver, ISO, and other styles
7

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.

Full text
Abstract:
Les protocoles de routage pour réseaux ad hoc actuels supposent l'absence totale de participants malveillants, alors que cette hypothèse est souvent contredite dans les applications. Nous avons cherché à enrichir les protocoles dits proactifs pour permettre aux nœuds de surveiller le réseau de manière distribuée et de mesurer la menace représentée par chacun des autres nœuds. Cette mesure sert à extraire une métrique de qualité de service utilisée ensuite par le protocole de routage pour contourner les nœuds les plus suspects d'après les différentes méthodes de détection utilisées. Nous proposons de détecter la perte de paquets de données, intentionnelle ou non. La détection est réalisée par une vérification distribuée du principe de conservation de flot, basée sur l'échange de compteurs de paquets entre voisins. Nous proposons également une méthode de diffusion de ces valeurs qui permet un meilleur passage à l'échelle. Cette détection ne sert qu'à maintenir un degré de suspicion local qui, une fois diffusé à tout le réseau et recombiné par les autres nœud, produit une métrique de suspicion globale envers chaque nœud. L'application au protocole OLSR est décrite et ses performances évaluées par simulation. Nous montrons que la solution est efficace et que l'impact du surcoût de contrôle sur la capacité du médium reste faible. Nous présentons enfin une plateforme expérimentale du protocole OLSR avec qualité de service et sécurité, servant à faire fonctionner nos solutions dans des mises en place réelles pour déceler les problèmes qui apparaissent lors de l'utilisation de matériel grand public
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
APA, Harvard, Vancouver, ISO, and other styles
8

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.

Full text
Abstract:
La coloration de graphes est un problème central de l'optimisation combinatoire. C'est un domaine très attractif par ses nombreuses applications. Différentes variantes et généralisations du problème de la coloration de graphes ont été proposées et étudiées. La coloration d'arêtes d'un graphe consiste à attribuer une couleur à chaque arête du graphe de sorte que deux arêtes ayant un sommet commun n'ont jamais la même couleur, le tout en utilisant le moins de couleurs possibles. Dans la première partie de cette thèse, nous étudions le problème de la coloration d'arêtes ℓ-distance, qui est une généralisation de la coloration d'arêtes classique. Nous menons une étude combinatoire et algorithmique du paramètre. L'étude porte sur les classes de graphes suivantes : les chaines, les grilles, les hypercubes, les arbres et des graphes puissances. Le paramètre de la coloration d'arêtes ℓ-distance permet de modéliser des problèmes dans des réseaux assez grands. Cependant, avec la multiplication du nombre de nœuds, les réseaux sont de plus en plus vulnérables aux défaillances (ou pannes). Dans la deuxième partie, nous nous intéressons aux algorithmes tolérants aux pannes et en particulier les algorithmes auto-stabilisants. Nous proposons un algorithme auto-stabilisant pour la coloration propre d'arêtes. Notre solution se base sur le résultat de vizing pour utiliser un minimum de couleurs possibles. Par la suite, nous proposons un algorithme auto-stabilisant de clustering destine a des applications dans le domaine de la sécurité dans les réseaux mobiles Ad hoc. La solution que nous proposons est un partitionnement en clusters base sur les relations de confiance qui existent entre nœuds. Nous proposons aussi un algorithme de gestion de clés de groupe dans les réseaux mobiles ad hoc qui s'appuie sur la topologie de clusters préalablement construite. La sécurité de notre protocole est renforcée par son critère de clustering qui surveille en permanence les relations de confiance et expulse les nœuds malveillants de la session de diffusion.
APA, Harvard, Vancouver, ISO, and other styles
9

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.

Full text
Abstract:
Les réseaux ad hoc sont des réseaux distribués, auto-organisés ne nécessitant pas d'infrastructure. Les entités formant un tel réseau doivent collaborer afin d'assurer le bon fonctionnement des services réseaux, tel que le routage. Dans un tel environnement, de nombreux algorithmes développés pour le monde filaire ne peuvent être adaptés de façon naïve sans entraîner une congestion importante du réseau qui va réduire son efficacité. Notre travail de thèse se penche sur l'étude de la gestion de services. En effet, sans application, le développement d'une architecture comme les réseaux ad hoc est inutile. La gestion de services consiste à fournir tout les moyens possibles pour faciliter et rendre fiable l'utilisation d'applications distribuées. Nos travaux contribuent à l'étude de deux points précis de la gestion de services. Premièrement, nous fournissons un algorithme permettant de répartir efficacement une information dans le réseau en sélectionnant certains objets du réseau pour être des réplicats de l'information. Cet algorithme peut alors être utilisé pour publier les informations relatives à un service afin de permettre sa recherche. Deuxièmement, nous avons étudié la prédiction de déconnexion entrainée par la mobilité des noeuds. Nous proposons trois solutions basées sur la recherche d'ensemble de chemins disjoints, la recherche de liens critiques et la recherche de noeuds critiques. Les recherches que nous proposons sont entièrement réalisées à partir d'informations locales. Les résultats obtenus fournissent une base au développement d'un gestionnaire de services distribués. De plus, certains de nos algorithmes (comme la recherche d'ensembles de chemins disjoints) peuvent être réutilisés dans d'autres applications, comme le routage QoS multi-chemins.
APA, Harvard, Vancouver, ISO, and other styles
10

Sahin, Serdar. "Advanced receivers for distributed cooperation in mobile ad hoc networks." Thesis, Toulouse, INPT, 2019. http://www.theses.fr/2019INPT0089.

Full text
Abstract:
Les réseaux ad hoc mobiles (MANETs) sont des systèmes de communication sans fil rapidement déployables et qui fonctionnent avec une coordination minimale, ceci afin d'éviter les pertes d'efficacité spectrale induites par la signalisation. Les stratégies de transmissions coopératives présentent un intérêt pour les MANETs, mais la nature distribuée de tels protocoles peut augmenter le niveau d'interférence avec un impact autant plus sévère que l'on cherche à pousser les limites des efficacités énergétique et spectrale. L'impact de l'interférence doit alors être réduit par l'utilisation d'algorithmes de traitement du signal au niveau de la couche PHY, avec une complexité calculatoire raisonnable. Des avancées récentes sur les techniques de conception de récepteurs numériques itératifs proposent d'exploiter l'inférence bayésienne approximée et des techniques de passage de message associés afin d'améliorer le potentiel des turbo-détecteurs plus classiques. Entre autres, la propagation d'espérance (EP) est une technique flexible, qui offre des compromis attractifs de complexité et de performance dans des situations où la propagation de croyance conventionnel est limité par sa complexité calculatoire. Par ailleurs, grâce à des techniques émergentes de l'apprentissage profond, de telles structures itératives peuvent être projetés vers des réseaux de détection profonds, où l'apprentissage des hyper-paramètres algorithmiques améliore davantage les performances. Dans cette thèse nous proposons des égaliseurs à retour de décision à réponse impulsionnelle finie basée sur la propagation d'espérance (EP) qui apportent des améliorations significatives, en particulier pour des applications à haute efficacité spectrale vis à vis des turbo-détecteurs conventionnels, tout en ayant l'avantage d'être asymptotiquement prédictibles. Nous proposons un cadre générique pour la conception de récepteurs dans le domaine fréquentiel, afin d'obtenir des architectures de détection avec une faible complexité calculatoire. Cette approche est analysée théoriquement et numériquement, avec un accent mis sur l'égalisation des canaux sélectifs en fréquence, et avec des extensions pour de la détection dans des canaux qui varient dans le temps ou pour des systèmes multi-antennes. Nous explorons aussi la conception de détecteurs multi-utilisateurs, ainsi que l'impact de l'estimation du canal, afin de comprendre le potentiel et le limite de cette approche. Pour finir, nous proposons une méthode de prédiction performance à taille finie, afin de réaliser une abstraction de lien pour l'égaliseur domaine fréquentiel à base d'EP. L'impact d'un modélisation plus fine de la couche PHY est évalué dans le contexte de la diffusion coopérative pour des MANETs tactiques, grâce à un simulateur flexible de couche MAC
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
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Algorithmes ad"

1

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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Dhillon, Santpal Singh. Ant routing, searching and topology estimation algorithms for ad hoc netwoks. Amsterdam: IOS Press, 2008.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

Dhillon, Santpal Singh. Ant routing, searching and topology estimation algorithms for ad hoc netwoks. Amsterdam: IOS Press, 2008.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

Azzedine, Boukerche, ed. Algorithms and protocols for wireless, mobile ad hoc networks. Hoboken, N.J: Wiley Interscience, 2008.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Xiang-Yang, Li, Pissinou Niki, Makki Shamila, Karimi Masoumeh, Makki Kia, and SpringerLink (Online service), eds. Sensor and Ad-Hoc Networks: Theoretical and Algorithmic Aspects. Boston, MA: Springer Science+Business Media, LLC, 2008.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
8

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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

1975-, Li Yonghui, ed. Cooperative communications: Hardware, channel & PHY. Chichester, West Sussex, U.K: Wiley, 2010.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
10

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.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Algorithmes ad"

1

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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

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.

Full text
Abstract:
AbstractDifferentiation is key to numerous scientific applications including maximizing or minimizing functions, solving systems of ODEs, physical simulation, etc. Of existing methods, algorithmic differentiation, or AD, is a computer-friendly technique for performing differentiation that is both efficient and accurate. AD is a central component of the architecture design of Owl. In this chapter, we will show, with hands-on examples, how the AD engine is designed and implemented in Owl. AD will be used in some of the other chapters to show its application in optimization and machine learning.
APA, Harvard, Vancouver, ISO, and other styles
4

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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

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.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Algorithmes ad"

1

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.

Full text
Abstract:
With the rapid growth of e-commerce and World Wide Web, internet advertising revenue has surpassed broadcast revenue very recently. As online advertising has become a major source of revenue for online publishers, such as Google and Amazon, one problem facing them is to optimize the ads selection and allocation in order to maximize their revenue. Although there is a rich body of work that has been devoted to this field, uncertainty about models and parameter settings is largely ignored in existing algorithm design. To fill this gap, we are the first to formulate and study the \emph{Robust Ad Allocation} problem, by taking into account the uncertainty about parameter settings. We define a Robust Ad Allocation framework with a set of candidate parameter settings, typically derived from different users or topics. Our main aim is to develop robust ad allocation algorithms, which can provide satisfactory performance across a spectrum of parameter settings, compared to the (parameter-specific) optimum solutions. We study this problem progressively and propose a series of algorithms with bounded approximation ratio.
APA, Harvard, Vancouver, ISO, and other styles
2

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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

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.

Full text
Abstract:
As autonomous AI agents proliferate in the real world, they will increasingly need to cooperate with each other to achieve complex goals without always being able to coordinate in advance. This kind of cooperation, in which agents have to learn to cooperate on the fly, is called ad hoc teamwork. Many previous works investigating this setting assumed that teammates behave according to one of many predefined types that is fixed throughout the task. This assumption of stationarity in behaviors, is a strong assumption which cannot be guaranteed in many real-world settings. In this work, we relax this assumption and investigate settings in which teammates can change their types during the course of the task. This adds complexity to the planning problem as now an agent needs to recognize that a change has occurred in addition to figuring out what is the new type of the teammate it is interacting with. In this paper, we present a novel Convolutional-Neural-Network-based Change point Detection (CPD) algorithm for ad hoc teamwork. When evaluating our algorithm on the modified predator prey domain, we find that it outperforms existing Bayesian CPD algorithms.
APA, Harvard, Vancouver, ISO, and other styles
4

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.

Full text
Abstract:
Abstract Both for active noise control (ANC) and active vibration control (AVC) the well known F-X-LMS-algorithm can be used. This approach requires a proper model of the path from the actuator to the error sensor, preferably received with an on-line identification. In the field of ANC adaptive finite impulse response (FIR) filters work well for this task, but for lightly damped mechanical systems with long impulse responses FIR filters with up to several thousand coefficients would have to be used. One alternative are adaptive IIR filters, but these can get unstable while adapting or the adapting process can get stuck in local minima. In this work, adaptive Kautz models are introduced, which need some a priori knowledge about the poles of the system. On the other hand, they represent an infinite impulse response while maintaining the transversal structure of the adaptive filter. This is reached by generalization of the FIR filter, for which the delay operator is substituted by discrete allpass filters, the Kautz filters. The adaptive filter bank is implemented by means of the straightforward LMS algorithm in the Matlab/Simulink environment. As an example, system identification with Kautz models and their usage in AVC for a simple mechanical system will be studied.
APA, Harvard, Vancouver, ISO, and other styles
5

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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

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.

Full text
Abstract:
Abstract A neural network based adaptive controller for smart structures is designed and validated experimentally. For a truly adaptive control system, the neurocontroller learns online in real time. The Levernberg-Marquardt backpropagation algorithm is implemented for fast learning. Piezoelectric actuators are employed to suppress the vibrations of a cantilevered beam subject to impulse, sine wave, and band-limited white noise disturbances. Experimental results demonstrate excellent closed-loop performance and robustness of the adaptive neurocontroller.
APA, Harvard, Vancouver, ISO, and other styles
7

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.

Full text
Abstract:
Abstract Porous shape memory alloys (SMAs) are a relatively new group of materials that are of interest because of their potential use in the design of vibration-control, damping and shock mitigation systems. Essential to the use of these materials is an understanding of their mid to high strain-rate response. The emphasis of this research is to develop a computational methodology that will bridge the microstructural and macrostructural features of porous SMAs. In a first attempt, information obtained from x-ray computed micro tomography (XCMT) images is employed in producing realistic finite element meshes with the help of probabilistic pore generating algorithms. Average constitutive behavior of porous SMA in the intermediate strain rate of 103/s is studied by simulating the compressional split-Hopkinson bar test. Preliminary results are obtained for selected pore volume fractions and distinct trends in material behavior are observed.
APA, Harvard, Vancouver, ISO, and other styles
8

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.

Full text
Abstract:
Abstract In this paper, the development procedure of an innovative control algorithm is shown, with the aim of improving handling performance of a high-end sport vehicle by actively controlling aerodynamic forces acting on the vehicle itself. The proposed control algorithm operates indirectly by modifying ride-heights of the vehicle through an active suspensions system. The vehicle dynamics analysis is conducted in parallel to the aerodynamics analysis performed in a concurrent engineering operation. The software used for control algorithms development is VI-CarRealTime, in co-simulation with Matlab-Simulink, with an extended use of the MaxPerformance package. Specific tracks have been implemented ad hoc to highlight the effects of the control systems operation in development phase. To better explore the potential of the technique, a fuzzy logic system was developed.
APA, Harvard, Vancouver, ISO, and other styles
9

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.

Full text
Abstract:
The paper presents a path planning algorithm for ship guidance in presence of obstacles, based on an ad hoc modified version of the Rapidly-exploring Random Tree (RRT*) algorithm. The proposed approach is designed to be part of a decision support system for the bridge operators, in order to enhance traditional navigation. Focusing on the maritime field, a review of the scientific literature dealing with motion planning is presented, showing potential benefits and weaknesses of the different approaches. Among the several methods, details on RRT and RRT* algorithms are given. The ship path planning problem is introduced and discussed, formulating suitable cost functions and taking into account both topological and kinematic constraints. Eventually, an existing time domain ship simulator is used to test the effectiveness of the proposed algorithm over a number of realistic operation scenarios. The obtained results are presented and critically discussed.
APA, Harvard, Vancouver, ISO, and other styles
10

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.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Algorithmes ad"

1

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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Algorithmes ad' for particular source types:
Journal articles Dissertations / Theses Books
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography