• Suche: "Analysis of algorithms and problem complexity"

Treffer 221 - 240 von 13.067

221

Défis computationnels des séquençage et phénotypage haut débit en science de la vie
Rivals, Eric ; Méthodes et Algorithmes pour la Bioinformatique (MAB) ; Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier (LIRMM) ; et al.

Strasbourg, France ACM: C.: Computer System... ACM: H.: Information Sys... H.3: INFORMATION STORAGE... ACM: F.: Theory of Compu... F.2: ANALYSIS OF ALGORIT... …
Konferenz
Zu den Favoriten
222

Computing Persistent Homology with Various Coefficient Fields in a Single Pass
Boissonnat, Jean-Daniel ; Maria, Clément ; Geometric computing (GEOMETRICA) ; et al.
European Symposium on Algorithms, European Association for Theoretical Computer Science (EATCS), Sep 2014, Wrocław, Poland

Wrocław, Poland Computational Topology P... ACM: F.: Theory of Compu... F.2: ANALYSIS OF ALGORIT... F.2.2: Nonnumerical Algo... F.2.2.2: Geometrical pro... …
Konferenz
Zu den Favoriten
223

The Maximum Degree of a Random Delaunay Triangulation in a Smooth Convex
Broutin, Nicolas ; Devillers, Olivier ; Hemsley, Ross ; et al.
AofA 2014 - 25th International Conference on Probabilistic. Algorithms(2014)

Paris, France ACM: F.: Theory of Compu... F.2: ANALYSIS OF ALGORIT... F.2.2: Nonnumerical Algo... F.2.2.2: Geometrical pro... [INFO.INFO-DS]Computer S... …
Konferenz
Zu den Favoriten
224

Efficiently Navigating a Random Delaunay Triangulation
Broutin, Nicolas ; Devillers, Olivier ; Hemsley, Ross ; et al.

Paris, France Delaunay Triangulation Randomised Analysis Point Location Routing ACM: F.: Theory of Compu... …
Konferenz
Zu den Favoriten
225

Affine consistency and the complexity of semilinear constraints
Jonsson, Peter ; Thapper, Johan ; Department of Computer and Information Science - Linköping University ; et al.
39th International Symposium on Mathematical Foundations of Computer Science (MFCS-2014), 2014, Budapest, Hungary

Budapest, Hungary ACM: F.: Theory of Compu... F.2: ANALYSIS OF ALGORIT... [INFO.INFO-CC]Computer S... Computational Complexity... [INFO.INFO-DS]Computer S... …
Konferenz
Zu den Favoriten
226

PoPe method for quantitative simulation verification of production runs
Ghendrih, Philippe ; Cartier-Michaud, Thomas ; Institut de Recherche sur la Fusion par confinement Magnétique (IRFM) ; et al.

ACM: F.: Theory of Compu... F.2: ANALYSIS OF ALGORIT... [PHYS.MECA.MEFL]Physics... Mechanics [physics] Fluid mechanics [physics... [SPI.PLASMA]Engineering... …
E-Ressource
Zu den Favoriten
227

Algorithmic Complexity of Well-Quasi-Orders
Complexité algorithmique des beaux pré-ordres
Schmitz, Sylvain ; Laboratoire Spécification et Vérification [Cachan] (LSV) ; École normale supérieure - Cachan (ENS Cachan)-Centre National de la Recherche Scientifique (CNRS) ; et al.
Logic in Computer Science [cs.LO]. École normale supérieure Paris-Saclay, 2017

Well-quasi-order infinite-state system fast-growing complexity vector addition system Petri net système infini …
Report
Zu den Favoriten
228

Algorithms for the Bin Packing Problem with Overlapping Items
Grange, Aristide ; Kacem, Imed ; Martin, Sébastien ; et al.

Virtual-Machine Packing Integer linear programmi... Heuristics Bin packing Pagination Genetic algorithms …
E-Ressource
Zu den Favoriten
229

Implementing fast carryless multiplication
van der Hoeven, Joris ; Larrieu, Robin ; Lecerf, Grégoire ; et al.

Polynomial multiplicatio... Finite field Frobenius FFT Implementation High performance MSC 68W30, 68Q17, 68W40 …
E-Ressource
Zu den Favoriten
230

Foundation for a series of efficient simulation algorithms
Cécé, Gérard ; Franche-Comté Électronique Mécanique, Thermique et Optique - Sciences et Technologies (UMR 6174) (FEMTO-ST) ; Université de Technologie de Belfort-Montbeliard (UTBM)-Ecole Nationale Supérieure de Mécanique et des Microtechniques (ENSMM)-Centre National de la Recherche Scientifique (CNRS)-Université de Franche-Comté (UFC) ; et al.

Simulation efficient algorithms preorders Kripke structures ACM: F.: Theory of Compu... F.2: ANALYSIS OF ALGORIT... …
E-Ressource
Zu den Favoriten
231

On the Boolean complexity of real root refinement
Pan, Victor, Y. ; Tsigaridas, Elias ; Department of Mathematics and Computer Science [Lehman] ; et al.
ISSAC 2013 - International Symposium on Symbolic and Algebraic Computation, Jun 2013, Boston, United States. ⟨10.1145/2465506.2465938⟩

Boston, United States real root refinement polynomial real root problem Boolean complexity ACM: F.: Theory of Compu... …
Konferenz
Zu den Favoriten
232

The Frobenius FFT
van der Hoeven, Joris ; Larrieu, Robin ; Laboratoire d'informatique de l'École polytechnique [Palaiseau] (LIX) ; et al.

FFT finite field complexity bound Frobenius automor-phisms MSC 68W30, 68Q17, 68W40 ACM: F.: Theory of Compu... …
E-Ressource
Zu den Favoriten
233

Montgomery curves and their arithmetic
Montgomery curves and their arithmetic: The case of large characteristic fields
Costello, Craig ; Smith, Benjamin ; Microsoft Research [Redmond] ; et al.
Journal of Cryptographic Engineering, 2017, Special issue on Montgomery arithmetic, ⟨10.1007/s13389-017-0157-6⟩

Addition chains Elliptic curve method Montgomery ladder Montgomery curves Elliptic curve cryptogra... Elliptic curve scalar mu... …
Zeitschrift
Zu den Favoriten
234

ImproteK: introducing scenarios into human-computer music improvisation
Nika, Jérôme ; Chemillier, Marc ; Assayag, Gérard ; et al.
ACM Computers in Entertainment, 2017, ⟨10.1145/3022635⟩

Planning under uncertain... Symbolic and algebraic a... Motif discovery Heuristic function const... Markov processes Combinatorics on words …
Zeitschrift
Zu den Favoriten
235

Optimally Gathering Two Robots
Heriban, Adam ; Défago, Xavier ; Tixeuil, Sébastien ; et al.
[Research Report] UPMC Sorbonne Universités. 2017

Mobile robots gathering robots with lights optimal ACM: C.: Computer System... C.2: COMPUTER-COMMUNICAT... …
Report
Zu den Favoriten
236

Revisiting the double checkpointing algorithm
Dongarra, Jack ; Herault, Thomas ; Robert, Yves ; et al.
APDCM 2013, IEEE, 2013, Boston, United States

Boston, United States ACM: G.: Mathematics of... G.3: PROBABILITY AND STA... G.3.10: Reliability and... ACM: F.: Theory of Compu... F.2: ANALYSIS OF ALGORIT... …
Konferenz
Zu den Favoriten
237

Complexity-separating graph classes for vertex, edge and total colouring
de Figueiredo, Celina M.H.
In Discrete Applied Mathematics 15 July 2020 281:162-171

Fachzeitschrift
Zu den Favoriten
238

Une stratégie de recherche basée sur la substituabilité
Rezgui, Mohammed ; Régin, Jean-Charles ; Malapert, Arnaud ; et al.
JFPC 2012 - Huitièmes Journées Francophones de Programmation par Contraintes - 2012, May 2012, Toulouse, France

Toulouse, France ACM: F.: Theory of Compu... F.2: ANALYSIS OF ALGORIT... F.2.2: Nonnumerical Algo... F.2.2.1: Computations on... [INFO.INFO-AI]Computer S... …
Konferenz
Zu den Favoriten
239

Characterizing the Adversarial Power in Uniform and Ergodic Node Sampling
Anceaume, Emmanuelle ; Busnel, Yann ; Gambs, Sébastien ; et al.
The 1st International Workshop on Algorithms and Models for Distributed Event Processing (AlMoDEP '11) collocated with the 25th International Symposium on Distributed Computing (DISC 2011), Sep 2011, Rome, Italy

Rome, Italy Theory Algorithms ACM: F.: Theory of Compu... F.2: ANALYSIS OF ALGORIT... F.2.2: Nonnumerical Algo... …
Konferenz
Zu den Favoriten
240

Coordination of a two-level supply chain with contracts
Phouratsamay, Siao-Leu ; Kedad-Sidhoum, Safia ; Pascual, Fanny
4OR: A Quarterly Journal of Operations Research. 19(2):235-264

Fachzeitschrift
Zu den Favoriten
Suchwerkzeuge: RSS-Feed abonnieren Diese Suche als E-Mail versenden Suche speichern

Filter