Einloggen

Thematische Bibliographien / Algorithme des directions alternées / Zeitschriftenartikel

Um die anderen Arten von Veröffentlichungen zu diesem Thema anzuzeigen, folgen Sie diesem Link: Algorithme des directions alternées.

Zeitschriftenartikel zum Thema „Algorithme des directions alternées“

Autor: Grafiati

Veröffentlicht am 25. Mai 2024

Zuletzt aktualisiert am 31. Juli 2025

Geben Sie eine Quelle nach APA, MLA, Chicago, Harvard und anderen Zitierweisen an

Wählen Sie eine Art der Quelle aus:

Machen Sie sich mit Top-15 Zeitschriftenartikel für die Forschung zum Thema "Algorithme des directions alternées" bekannt.

Neben jedem Werk im Literaturverzeichnis ist die Option "Zur Bibliographie hinzufügen" verfügbar. Nutzen Sie sie, wird Ihre bibliographische Angabe des gewählten Werkes nach der nötigen Zitierweise (APA, MLA, Harvard, Chicago, Vancouver usw.) automatisch gestaltet.

Sie können auch den vollen Text der wissenschaftlichen Publikation im PDF-Format herunterladen und eine Online-Annotation der Arbeit lesen, wenn die relevanten Parameter in den Metadaten verfügbar sind.

Sehen Sie die Zeitschriftenartikel für verschiedene Spezialgebieten durch und erstellen Sie Ihre Bibliographie auf korrekte Weise.

1

Dia, Boun Oumar, and Michelle Schatzman. "Commutateurs de certains semi-groupes holomorphes et applications aux directions alternées." ESAIM: Mathematical Modelling and Numerical Analysis 30, no. 3 (1996): 343–83. http://dx.doi.org/10.1051/m2an/1996300303431.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

2

Luber, Marilyn, and Francine Shapiro. "Entretien avec Francine Shapiro: aperçu historique, questions actuelles et directions futures de l’EMDR." Journal of EMDR Practice and Research 4, no. 2 (2010): 1–17. http://dx.doi.org/10.1891/1933-3196.4.2.e1.

Der volle Inhalt der Quelle

Annotation:

Cet entretien avec Dr Francine Shapiro, inventrice et conceptrice de la thérapie EMDR (Eye Movement Desensitization and Reprocessing : thérapie d’intégration neuro-émotionnelle par des stimulations bilatérales alternées) apporte un aperçu de l’histoire et de l’évolution de l’EMDR depuis ses origines jusqu’aux résultats actuels et à leur utilisation, ainsi que les directions futures pour la recherche et le développement de la clinique. Dr Shapiro examine les traditions psychologiques qui ont guidé le développement de l’EMDR et le modèle de l’information adaptative, ainsi que les implications po

APA, Harvard, Vancouver, ISO und andere Zitierweisen

3

CASTRO, CARLOS, FRANCISCO PALACIOS, and ENRIQUE ZUAZUA. "AN ALTERNATING DESCENT METHOD FOR THE OPTIMAL CONTROL OF THE INVISCID BURGERS EQUATION IN THE PRESENCE OF SHOCKS." Mathematical Models and Methods in Applied Sciences 18, no. 03 (2008): 369–416. http://dx.doi.org/10.1142/s0218202508002723.

Der volle Inhalt der Quelle

Annotation:

We introduce a new optimization strategy to compute numerical approximations of minimizers for optimal control problems governed by scalar conservation laws in the presence of shocks. We focus on the 1 - d inviscid Burgers equation. We first prove the existence of minimizers and, by a Γ-convergence argument, the convergence of discrete minima obtained by means of numerical approximation schemes satisfying the so-called one-sided Lipschitz condition (OSLC). Then we address the problem of developing efficient descent algorithms. We first consider and compare the existing two possible approaches:

APA, Harvard, Vancouver, ISO und andere Zitierweisen

4

Chour, Kenny, Sivakumar Rathinam, and Ramamoorthi Ravi. "S*: A Heuristic Information-Based Approximation Framework for Multi-Goal Path Finding." Proceedings of the International Conference on Automated Planning and Scheduling 31 (May 17, 2021): 85–93. http://dx.doi.org/10.1609/icaps.v31i1.15950.

Der volle Inhalt der Quelle

Annotation:

We combine ideas from uni-directional and bi-directional heuristic search, and approximation algorithms for the Traveling Salesman Problem, to develop a novel framework for a Multi-Goal Path Finding (MGPF) problem that provides a 2-approximation guarantee. MGPF aims to find a least-cost path from an origin to a destination such that each node in a given set of goals is visited at least once along the path. We present numerical results to illustrate the advantages of our framework over conventional alternates in terms of the number of expanded nodes and run time.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

5

MAO, RUI, WEIJIA XU, NEHA SINGH, and DANIEL P. MIRANKER. "AN ASSESSMENT OF A METRIC SPACE DATABASE INDEX TO SUPPORT SEQUENCE HOMOLOGY." International Journal on Artificial Intelligence Tools 14, no. 05 (2005): 867–85. http://dx.doi.org/10.1142/s0218213005002430.

Der volle Inhalt der Quelle

Annotation:

Hierarchical metric-space clustering methods have been commonly used to organize proteomes into taxonomies. Consequently, it is often anticipated that hierarchical clustering can be leveraged as a basis for scalable database index structures capable of managing the hyper-exponential growth of sequence data. M-tree is one such data structure specialized for the management of large data sets on disk. We explore the application of M-trees to the storage and retrieval of peptide sequence data. Exploiting a technique first suggested by Myers, we organize the database as records of fixed length subs

APA, Harvard, Vancouver, ISO und andere Zitierweisen

6

Li, Xianglu, Youyang Xiang, Jie Zhou, et al. "Physical-Layer Security Enhancement for UAV Downlink Communication Using Joint Precoding and Artificial Noise Design in Generalized Spatial Directional Modulation." Drones 9, no. 3 (2025): 199. https://doi.org/10.3390/drones9030199.

Der volle Inhalt der Quelle

Annotation:

This paper proposes a novel joint precoding and artificial noise design framework for generalized spatial directional modulation (AN-GSDM) in unmanned aerial vehicle (UAV) communications, aimed at enhancing the physical-layer security of downlink UAV communication systems. The key innovation lies in the dynamic co-optimization of multi-beam control and artificial noise (AN) power allocation under mobility constraints, enabling real-time adaptation to varying channel conditions. This approach jointly optimizes the precoding matrix and power-control factor, facilitating the effective management

APA, Harvard, Vancouver, ISO und andere Zitierweisen

7

Jun, Jong Woo, Jin Yi Lee, Ki Su Shin, and Jung Ho Hong. "Quantitative Nondestructive Evaluation of the Aluminum Alloy Using the Sheet Type Induced Current and the Single Sensor Scanning." Key Engineering Materials 417-418 (October 2009): 641–44. http://dx.doi.org/10.4028/www.scientific.net/kem.417-418.641.

Der volle Inhalt der Quelle

Annotation:

Single sensor scanning (hereafter SSS) used to inspect cracks on paramagnetic materials can measure the distribution of the root mean squared value (RMS) of the magnetic field around crack tips quantitatively when sheet type current is induced on the specimen. The vertical direction magnetic field alternates to the surface of the crack tips because the sheet type induced current on the specimen is distorted by the existence of the crack in an SSS system. The RMS distribution of the magnetic field, which can be measured by using SSS, depends on the crack size and shape, so it can be used to eva

APA, Harvard, Vancouver, ISO und andere Zitierweisen

8

Frantz, David, Marion Stellmes, Achim Röder, and Joachim Hill. "Fire spread from MODIS burned area data: obtaining fire dynamics information for every single fire." International Journal of Wildland Fire 25, no. 12 (2016): 1228. http://dx.doi.org/10.1071/wf16003.

Der volle Inhalt der Quelle

Annotation:

Fire spread information on a large scale is still a missing key layer for a complete description of fire regimes. We developed a novel multilevel object-based methodology that extracts valuable information about fire dynamics from Moderate Resolution Imaging Spectroradiometer (MODIS) burned area data. Besides the large area capabilities, this approach also derives very detailed information for every single fire regarding timing and location of its ignition, as well as detailed directional multitemporal spread information. The approach is a top–down approach and a multilevel segmentation strate

APA, Harvard, Vancouver, ISO und andere Zitierweisen

9

Cuculo, Vittorio, Alessandro D’Amelio, Giuliano Grossi, Raffaella Lanzarotti, and Jianyi Lin. "Robust Single-Sample Face Recognition by Sparsity-Driven Sub-Dictionary Learning Using Deep Features." Sensors 19, no. 1 (2019): 146. http://dx.doi.org/10.3390/s19010146.

Der volle Inhalt der Quelle

Annotation:

Face recognition using a single reference image per subject is challenging, above all when referring to a large gallery of subjects. Furthermore, the problem hardness seriously increases when the images are acquired in unconstrained conditions. In this paper we address the challenging Single Sample Per Person (SSPP) problem considering large datasets of images acquired in the wild, thus possibly featuring illumination, pose, face expression, partial occlusions, and low-resolution hurdles. The proposed technique alternates a sparse dictionary learning technique based on the method of optimal di

APA, Harvard, Vancouver, ISO und andere Zitierweisen

10

Mishra, Ashish, and Suresh Jagannathan. "Specification-guided component-based synthesis from effectful libraries." Proceedings of the ACM on Programming Languages 6, OOPSLA2 (2022): 616–45. http://dx.doi.org/10.1145/3563310.

Der volle Inhalt der Quelle

Annotation:

Component-based synthesis seeks to build programs using the APIs provided by a set of libraries. Oftentimes, these APIs have effects, which make it challenging to reason about the correctness of potential synthesis candidates. This is because changes to global state made by effectful library procedures affect how they may be composed together, yielding an intractably large search space that can confound typical enumerative synthesis techniques. If the nature of these effects are exposed as part of their specification, however, deductive synthesis approaches can be used to help guide the search

APA, Harvard, Vancouver, ISO und andere Zitierweisen

11

Gondzio, Jacek, and Francisco N. C. Sobral. "Polynomial worst-case iteration complexity of quasi-Newton primal-dual interior point algorithms for linear programming." Computational Optimization and Applications, June 7, 2024. http://dx.doi.org/10.1007/s10589-024-00584-6.

Der volle Inhalt der Quelle

Annotation:

AbstractQuasi-Newton methods are well known techniques for large-scale numerical optimization. They use an approximation of the Hessian in optimization problems or the Jacobian in system of nonlinear equations. In the Interior Point context, quasi-Newton algorithms compute low-rank updates of the matrix associated with the Newton systems, instead of computing it from scratch at every iteration. In this work, we show that a simplified quasi-Newton primal-dual interior point algorithm for linear programming, which alternates between Newton and quasi-Newton iterations, enjoys polynomial worst-cas

APA, Harvard, Vancouver, ISO und andere Zitierweisen

12

Liu, Xu T., Andrew Lumsdaine, Mahantesh Halappanavar, Kevin Barker, and Assefaw H. Gebremedhin. "Direction-Optimizing Label Propagation Framework for Structure Detection in Graphs: Design, Implementation, and Experimental Analysis." ACM Journal of Experimental Algorithmics, October 27, 2022. http://dx.doi.org/10.1145/3564593.

Der volle Inhalt der Quelle

Annotation:

Label Propagation is not only a well-known machine learning algorithm for classification, but it is also an effective method for discovering communities and connected components in networks. We propose a new Direction-Optimizing Label Propagation Algorithm (DOLPA) framework that enhances the performance of the standard Label Propagation Algorithm (LPA), increases its scalability, and extends its versatility and application scope. As a central feature, the DOLPA framework relies on the use of frontiers and alternates between label push and label pull operations to attain high performance. It is

APA, Harvard, Vancouver, ISO und andere Zitierweisen

13

Wallet, Guy. "Integer calculus on the Harthong-Reeb Line." Revue Africaine de la Recherche en Informatique et Mathématiques Appliquées Volume 9, 2007 Conference in... (August 8, 2008). http://dx.doi.org/10.46298/arima.1911.

Der volle Inhalt der Quelle

Annotation:

International audience In this work, we give a presentation of the so-called Harthong-Reeb line. Only based on integer numbers, this numerical system has the striking property to be roughly equivalent to the continuous real line. Its definition requires the use of a natural number w which is infinitely large in the meaning of nonstandard analysis. Following the idea of G. Reeb, we show how to implement in this framework the Euler scheme. Then we get an exact representation in the Harthong-Reeb line of many real functions like the exponential. Since this representation is given with the help of

APA, Harvard, Vancouver, ISO und andere Zitierweisen

14

Alvelos, Filipe, Marco Marto, and André Mendes. "Dispatching, Positioning and Routing Resources for Wildfire Initial Attack." Networks, April 3, 2025. https://doi.org/10.1002/net.22278.

Der volle Inhalt der Quelle

Annotation:

ABSTRACTWildfire is a global issue that requires contributions from different fields to address its multiple and potentially severe impacts. The subject of this paper is wildfire suppression. In particular, a mixed integer programming (MIP) model is formulated for dispatching, positioning, and routing firefighting resources (e.g., crews and helicopters) in the initial attack. Following the minimum travel time principle, wildfire spread is modeled as the shortest path in a network, as is common in the literature for this type of approach. As for modeling resource movements and attack positions,

APA, Harvard, Vancouver, ISO und andere Zitierweisen

15

Fekih, Mariem, Patrick Bonnel, Zbigniew Smoreda, Tom Bellemans, Angelo Furno, and Stéphane Galland. "Filtering and treatment methodology applied to cellular network signaling data for origin-destination matrix construction: application to Rhone-Alpes region." Les Cahiers Scientifiques du Transport - Scientific Papers in Transportation 75 | 2019 (December 31, 2019). http://dx.doi.org/10.46298/cst.12183.

Der volle Inhalt der Quelle

Annotation:

Origin-Destination (O-D) matrices are a necessary input for transport planning to support both mobility modeling and analysis tasks. Several research works have investigated the possibility to compute O-D matrices from mobile phone data. However, most of these works rely on billing data (call detail records). In this paper, network signaling data is leveraged, and the advantages of this kind of data to produce O-D matrices are highlighted. A three-step algorithm based on data filtering, users’ home detection and sector-based expansion factors is proposed. Additionally, a validation step is inc

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Wir bieten Rabatte auf alle Premium-Pläne für Autoren, deren Werke in thematische Literatursammlungen aufgenommen wurden. Kontaktieren Sie uns, um einen einzigartigen Promo-Code zu erhalten!