Bibliografie tematiche / Algorithmes ad

Indice

  1. Articoli di riviste
  2. Tesi
  3. Libri
  4. Capitoli di libri
  5. Atti di convegni
  6. Rapporti di organizzazioni

Letteratura scientifica selezionata sul tema "Algorithmes ad"

Autore: Grafiati
Pubblicato: 1 febbraio 2023
Ultima modifica: 19 luglio 2025

Cita una fonte nei formati APA, MLA, Chicago, Harvard e in molti altri stili

Scegli il tipo di fonte:

Consulta la lista di attuali articoli, libri, tesi, atti di convegni e altre fonti scientifiche attinenti al tema "Algorithmes ad".

Accanto a ogni fonte nell'elenco di riferimenti c'è un pulsante "Aggiungi alla bibliografia". Premilo e genereremo automaticamente la citazione bibliografica dell'opera scelta nello stile citazionale di cui hai bisogno: APA, MLA, Harvard, Chicago, Vancouver ecc.

Puoi anche scaricare il testo completo della pubblicazione scientifica nel formato .pdf e leggere online l'abstract (il sommario) dell'opera se è presente nei metadati.

Articoli di riviste sul tema "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 (2021): 35–39. http://dx.doi.org/10.1609/aiide.v10i5.12763.

Testo completo
Abstract (sommario):
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.
Gli stili APA, Harvard, Vancouver, ISO e altri
2

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.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
3

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

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
4

Cromer, Sara J., Victoria Chen, Christopher Han, et al. "Algorithmic identification of atypical diabetes in electronic health record (EHR) systems." PLOS ONE 17, no. 12 (2022): e0278759. http://dx.doi.org/10.1371/journal.pone.0278759.

Testo completo
Abstract (sommario):
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).
Gli stili APA, Harvard, Vancouver, ISO e altri
5

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.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
6

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 (2021): 1–25. http://dx.doi.org/10.1145/3479573.

Testo completo
Abstract (sommario):
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.
Gli stili APA, Harvard, Vancouver, ISO e altri
7

Seetaram M Nagaraju, J. "Energy Efficient Routing Algorithm for Future Ad-hoc Wireless Networks." International Journal of Science and Research (IJSR) 13, no. 2 (2024): 736–41. http://dx.doi.org/10.21275/sr24205221635.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
8

S Arun Korath, Sangheethaa. "Comparison of Algorithms used in Blockchain-based Mobile Ad Hoc Networks (MANETs)." International Journal of Science and Research (IJSR) 12, no. 4 (2023): 288–92. http://dx.doi.org/10.21275/sr23404135052.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
9

Aydın, Nevin. "Heuristic Clustering Algorithms in Ad hoc Networks." EMAJ: Emerging Markets Journal 3, no. 3 (2014): 77–80. http://dx.doi.org/10.5195/emaj.2014.39.

Testo completo
Abstract (sommario):
The clustering allows dividing the geographical region to be covered into small zones in which each zone can be handled with a powerful node called clusterhead. The clusterheads have direct communication link with each of its members whereas the member nodes of a cluster must go through the clusterhead to communicate with each other. Since choosing clusterheads optimally is an NP-hard problem, existing solutions to this problem are based on heuristic (mostly greedy) approaches. In this paper, we present three well-known heuristic clustering algorithms: the Lowest-ID, the Highest-Degree, and the Node-Weight.
Gli stili APA, Harvard, Vancouver, ISO e altri
10

Miralles Pechuán, Luis, Claudia Sánchez Gómez, and Lourdes Martínez Villaseñor. "Ad Exchange Optimization Algorithms on Advertising Networks." Research in Computing Science 84, no. 1 (2014): 77–88. http://dx.doi.org/10.13053/rcs-84-1-7.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
Più fonti

Tesi sul tema "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.

Testo completo
Abstract (sommario):
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<br>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
Gli stili APA, Harvard, Vancouver, ISO e altri
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.

Testo completo
Abstract (sommario):
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.
Gli stili APA, Harvard, Vancouver, ISO e altri
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.

Testo completo
Abstract (sommario):
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<br>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
Gli stili APA, Harvard, Vancouver, ISO e altri
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/.

Testo completo
Abstract (sommario):
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. [. . . ]<br>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
Gli stili APA, Harvard, Vancouver, ISO e altri
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.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
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.

Testo completo
Abstract (sommario):
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<br>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
Gli stili APA, Harvard, Vancouver, ISO e altri
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.

Testo completo
Abstract (sommario):
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<br>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
Gli stili APA, Harvard, Vancouver, ISO e altri
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.

Testo completo
Abstract (sommario):
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.
Gli stili APA, Harvard, Vancouver, ISO e altri
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.

Testo completo
Abstract (sommario):
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.
Gli stili APA, Harvard, Vancouver, ISO e altri
10

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

Testo completo
Abstract (sommario):
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<br>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
Gli stili APA, Harvard, Vancouver, ISO e altri
Più fonti

Libri sul tema "Algorithmes ad"

1

Wagner, Dorothea, and Roger Wattenhofer, eds. Algorithms for Sensor and Ad Hoc Networks. Springer Berlin Heidelberg, 2007. http://dx.doi.org/10.1007/978-3-540-74991-2.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
2

Dorronsoro, Bernabé, Patricia Ruiz, Grégoire Danoy, Yoann Pigné, and Pascal Bouvry. Evolutionary Algorithms for Mobile Ad Hoc Networks. John Wiley & Sons, Inc., 2014. http://dx.doi.org/10.1002/9781118833209.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
3

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

Cerca il testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
4

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

Cerca il testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
5

Dorothea, Wagner, and Wattenhofer Roger 1969-, eds. Algorithms for sensor and ad hoc networks: Advanced lectures. Springer, 2007.

Cerca il testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
6

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

Cerca il testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
7

Boukerche, Azzedine, ed. Algorithms and Protocols for Wireless and Mobile Ad Hoc Networks. John Wiley & Sons, Inc., 2008. http://dx.doi.org/10.1002/9780470396384.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
8

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. Springer Science+Business Media, LLC, 2008.

Cerca il testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
9

Nikoletseas, Sotiris, Yuanyuan Yang, and Apostolos Georgiadis, eds. Wireless Power Transfer Algorithms, Technologies and Applications in Ad Hoc Communication Networks. Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-46810-5.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
10

Siomina, Iana. Radio network planning and resource optimization: Mathematical models and algorithms for UMTS, WLANs, and ad hoc networks. Department of Science and Technology, Linko ping University, 2007.

Cerca il testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
Più fonti

Capitoli di libri sul tema "Algorithmes ad"

1

Kao, Ming-Yang. "Ad-Hoc Networks." In Encyclopedia of Algorithms. Springer US, 2008. http://dx.doi.org/10.1007/978-0-387-30162-4_3.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
2

Dvořák, Wolfgang, and Monika Henzinger. "Online Ad Assignment with an Ad Exchange." In Approximation and Online Algorithms. Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-18263-6_14.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
3

Wang, Liang, and Jianxin Zhao. "Algorithmic Differentiation." In Architecture of Advanced Numerical Analysis Systems. Apress, 2022. http://dx.doi.org/10.1007/978-1-4842-8853-5_3.

Testo completo
Abstract (sommario):
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.
Gli stili APA, Harvard, Vancouver, ISO e altri
4

Fu, Hu, Patrick Jordan, Mohammad Mahdian, Uri Nadav, Inbal Talgam-Cohen, and Sergei Vassilvitskii. "Ad Auctions with Data." In Algorithmic Game Theory. Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-33996-7_15.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
5

Alaei, Saeed, Mohammad T. Hajiaghayi, Vahid Liaghat, Dan Pei, and Barna Saha. "AdCell: Ad Allocation in Cellular Networks." In Algorithms – ESA 2011. Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-23719-5_27.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
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. Springer New York, 2002. http://dx.doi.org/10.1007/978-1-4613-0075-5_30.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
7

Giering, Ralf, and Thomas Kaminski. "Recomputations in Reverse Mode AD." In Automatic Differentiation of Algorithms. Springer New York, 2002. http://dx.doi.org/10.1007/978-1-4613-0075-5_33.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
8

Kučera, Luděk. "Low Degree Connectivity in Ad-Hoc Networks." In Algorithms – ESA 2005. Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11561071_20.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
9

Kao, Ming-Yang. "Multi-Hop Radio Networks, Ad Hoc Networks." In Encyclopedia of Algorithms. Springer US, 2008. http://dx.doi.org/10.1007/978-0-387-30162-4_248.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
10

Yao, Frances F. "Algorithmic Problems in Wireless Ad Hoc Networks." In Algorithms and Computation. Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11602613_1.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri

Atti di convegni sul tema "Algorithmes ad"

1

Song, Jun, Shrivatsan Rajagopalan, Printha Wijesinghe, et al. "Imaging Retinal Hyperreflective Foci with Optical Coherence Microscopy: A Potential Biomarker for Alzheimer’s Disease." In Bio-Optics: Design and Application. Optica Publishing Group, 2025. https://doi.org/10.1364/boda.2025.jw4a.15.

Testo completo
Abstract (sommario):
Ex vivo optical coherence microscopy and numerical refocusing algorithm were used to image retinal hyperreflective foci (HRF) in Alzheimer’s disease (AD) patients. Enhanced imaging depth revealed HRF absent in controls, suggesting potential biomarkers for AD.
Gli stili APA, Harvard, Vancouver, ISO e altri
2

Vadakkethil Somanathan Pillai, Sanjaikanth E., Piyush Kumar Pareek, Kiran Polimetla, Pankaj Zanke, and Hassan Mohamed Ali. "Cluster Head Selection using Dingo Optimization Algorithm in Mobile Ad Hoc Network." In 2024 International Conference on Intelligent Algorithms for Computational Intelligence Systems (IACIS). IEEE, 2024. http://dx.doi.org/10.1109/iacis61494.2024.10721848.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
3

Saxena, Aayushi, Arpita, and Soni Singh. "Detecting Alzheimer’s Disease (AD) Using Machine Learning Algorithms." In 2024 4th Asian Conference on Innovation in Technology (ASIANCON). IEEE, 2024. https://doi.org/10.1109/asiancon62057.2024.10837764.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
4

Tang, Shaojie. "Robust Advertisement Allocation." In Twenty-Sixth International Joint Conference on Artificial Intelligence. International Joint Conferences on Artificial Intelligence Organization, 2017. http://dx.doi.org/10.24963/ijcai.2017/617.

Testo completo
Abstract (sommario):
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.
Gli stili APA, Harvard, Vancouver, ISO e altri
5

Seldin, J. H., and J. R. Fienup. "Phase Retrieval Using Ayers/Dainty Deconvolution." In Signal Recovery and Synthesis. Optica Publishing Group, 1989. http://dx.doi.org/10.1364/srs.1989.fa3.

Testo completo
Abstract (sommario):
An iterative algorithm developed by Ayers and Dainty [1] for the blind deconvolution of two functions is applied to the problem of phase retrieval. Because its structure closely resembles that of the Error Reduction (ER) algorithm commonly used for phase retrieval [2-4], the performance of the Ayers/Dainty (AD) algorithm is compared with that of ER. Both of these algorithms are compared to the faster hybrid input-output (HIO) algorithm [2-4] for the cases of real, nonnegative objects with known and unknown support using Fourier intensity data with different levels of additive Gaussian noise.
Gli stili APA, Harvard, Vancouver, ISO e altri
6

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. ACM, 2021. http://dx.doi.org/10.1145/3437963.3441801.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
7

Krokidis, Marios, Aristidis Vrahatis, George Dimitrakopoulos, Konstantina Skolariki, Panagiotis Vlamos, and Themis Exarchos. "Structural simulations predicting protein folding in Alzheimer’s disease." In 2nd International Conference on Chemo and Bioinformatics. Institute for Information Technologies, University of Kragujevac, 2023. http://dx.doi.org/10.46793/iccbi23.338k.

Testo completo
Abstract (sommario):
Proteins assume a suitable spatial structure to effectively execute their intracellular functions. The occurrence of protein misfolding, resulting from single point mutations or external influences, along with the consequent buildup of protein aggregates, can lead to diverse pathological processes like neurodegenerative disorders. Protein misfolding serves as a risk indicator for Alzheimer’s disease (AD), the prevailing cause of neurodegenerative dementia in the elderly, characterized by gradual cognitive impairment. Several structure prediction algorithms and computational approaches have been developed to address this challenge. The present work focuses on specific proteins related to AD and aims to verify their conformation through ColabFold which utilizes the MMseqs2 algorithm to quickly provide multiple sequence alignments. The predicted models were then compared to selected PDB structures, a superposition was created and the TM-score and RMSD metrics were assessed. In addition, a comprehensive look into the superposed structures was performed to observe any potent deviations between pairs of residues. These notable findings encompass precise direct sequence-to-structure patterns found in individual AD polypeptides motifs and well-folded domains.
Gli stili APA, Harvard, Vancouver, ISO e altri
8

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}. International Joint Conferences on Artificial Intelligence Organization, 2019. http://dx.doi.org/10.24963/ijcai.2019/78.

Testo completo
Abstract (sommario):
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.
Gli stili APA, Harvard, Vancouver, ISO e altri
9

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.

Testo completo
Abstract (sommario):
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.
Gli stili APA, Harvard, Vancouver, ISO e altri
10

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.

Testo completo
Abstract (sommario):
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.
Gli stili APA, Harvard, Vancouver, ISO e altri

Rapporti di organizzazioni sul tema "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. Defense Technical Information Center, 2010. http://dx.doi.org/10.21236/ada536094.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
2

Pasupuleti, Murali Krishna. AI-Driven Marketing Innovations: Personalization and Ethics in the Digital Era. National Education Services, 2025. https://doi.org/10.62311/nesx/rr625.

Testo completo
Abstract (sommario):
Abstract: This article explores the transformative impact of artificial intelligence (AI) on digital marketing, focusing on strategies for delivering personalized content and ensuring ethical advertising. By leveraging AI, marketers can now analyze consumer behavior with precision, enabling targeted content, automated ad placement, and real-time adjustments that enhance user engagement and conversions. The Article examines foundational AI techniques, such as recommendation engines, predictive analytics, and natural language processing, which drive personalization at scale. Additionally, it addresses critical ethical considerations, including data privacy, transparency in AI-driven decisions, and reducing algorithmic bias to ensure fair, trustworthy, and responsible marketing practices. Looking ahead, this Article highlights emerging trends like hyper-personalization, ethical AI frameworks, and the integration of AI with technologies like AR/VR and IoT, offering a forward-looking perspective on AI's role in shaping consumer-centric and ethical digital marketing. Keywords: Artificial intelligence, digital marketing, personalized content, ethical advertising, consumer behavior, recommendation engines, predictive analytics, natural language processing, data privacy, transparency, algorithmic bias, hyper-personalization, responsible marketing, AR/VR, IoT, consumer engagement.
Gli stili APA, Harvard, Vancouver, ISO e altri
Ti possono interessare anche gli elenchi estesi di opere sul tema "Algorithmes ad":
Articoli di riviste Tesi Libri
Offriamo sconti su tutti i piani premium per gli autori le cui opere sono incluse in raccolte letterarie tematiche. Contattaci per ottenere un codice promozionale unico!

Vai alla bibliografia