• Suche: "Analysis of algorithms and problem complexity"

Treffer 201 - 220 von 13.067

201

Line transversals to disjoint balls
Borcea, Ciprian ; Goaoc, Xavier ; Petitjean, Sylvain ; et al.
Discrete and Computational Geometry. 39(1-3):158-173

ACM: F.: Theory of Compu... F.2: ANALYSIS OF ALGORIT... F.2.2: Nonnumerical Algo... F.2.2.2: Geometrical pro... [INFO.INFO-CG]Computer S... Computational Geometry [...
Zeitschrift
Zu den Favoriten
202

Near-Optimal Parameterization of the Intersection of Quadrics: I. The Generic Algorithm
Dupont, Laurent ; Lazard, Daniel ; Lazard, Sylvain ; et al.
Journal of Symbolic Computation. 43(3):168-191

curve parameterization pencils of quadrics quadrics Intersection of surfaces ACM: F.: Theory of Compu... F.2: ANALYSIS OF ALGORIT... …
Zeitschrift
Zu den Favoriten
203

On Markov Policies For Decentralized POMDPs
Sur les politiques Markoviennes pour les Dec-POMDPs
Dibangoye, Jilles ; Robots coopératifs et adaptés à la présence humaine en environnements dynamiques (CHROMA) ; Centre Inria de l'Université Grenoble Alpes ; et al.
[Research Report] RR-9202, INRIA Grenoble - Rhone-Alpes - CHROMA Team; CITI - CITI Centre of Innovation in Telecommunications and Integration of services; INSA Lyon. 2018

Markov decision processe... Centralized planning Markov policies Decentralized control Planification Multi-Agen... Processus décisionnels d... …
Report
Zu den Favoriten
204

Beeping a Deterministic Time-Optimal Leader Election
Dufoulon, Fabien ; Burman, Janna ; Beauquier, Joffroy ; et al.
[Research Report] LRI, Université Paris-Sud, CNRS, Université Paris-Saclay. 2018

distributed algorithms leader election beeping model time complexity deterministic algorithms wireless networks …
Report
Zu den Favoriten
205

Computing real solutions of polynomial fuzzy systems
Résolution réelle de systèmes polynomiaux flous
Aubry, Philippe ; Marrez, Jérémy ; Valibouze, Annick ; et al.

ACM: I.: Computing Metho... I.2: ARTIFICIAL INTELLIG... I.2.3: Deduction and The... I.2.3.8: Uncertainty, ``... I.1: SYMBOLIC AND ALGEBR... ACM: F.: Theory of Compu... …
E-Ressource
Zu den Favoriten
206

Churn Possibilities and Impossibilities
Foreback, Dianne ; Nesterenko, Mikhail ; Tixeuil, Sébastien ; et al.
[Research Report] Kent State University; Sorbonne Université, CNRS, Laboratoire d’Informatique de Paris 6, LIP6, F-75005 Paris, France. 2018

ACM: C.: Computer System... C.2: COMPUTER-COMMUNICAT... ACM: D.: Software D.1: PROGRAMMING TECHNIQ... ACM: F.: Theory of Compu... F.2: ANALYSIS OF ALGORIT... …
Report
Zu den Favoriten
207

Topology, homogeneity and scale factors for object detection: application of eCognition software for urban mapping using multispectral satellite image
Lemenkova, Polina ; Ocean University of China (OUC)
7th International Scientific and Practical Conference 'Internet and Society. Modeling'. INSO2015., Jul 2015, Kutaisi, Georgia

Kutaisi, Georgia ACM: I.: Computing Metho... I.4: IMAGE PROCESSING AN... I.4.1: Digitization and... I.4.1.1: Imaging geometr... I.4.3: Enhancement …
Konferenz
Zu den Favoriten
208

Building Efficient and Compact Data Structures for Simplicial Complexes
Boissonnat, Jean-Daniel ; Karthik, C. S. ; Tavenas, Sébastien ; et al.

Eindhoven, Netherlands compact data structures Simplicial complex automaton NP-hard ACM: F.: Theory of Compu... …
Konferenz
Zu den Favoriten
209

Sherali-Adams relaxations for valued CSPs
Thapper, Johan ; Živný, Stanislav ; Laboratoire d'Informatique Gaspard-Monge (LIGM) ; et al.
42nd International Colloquium on Automata, Languages, and Programming (ICALP-2015), 2015, Kyoto, Japan

Kyoto, Japan 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
210

Complexity of Master-slave Tasking on Heterogeneous Trees
Dutot, Pierre-François ; Parallel algorithms and load sharing (APACHE) ; Informatique et Distribution (ID-IMAG) ; et al.
European Journal of Operational Research. 164(3):690-695

Master-Slave Tasks Heterogeneous NP-Completeness ACM: F.: Theory of Compu... F.2: ANALYSIS OF ALGORIT... [INFO.INFO-DC]Computer S... …
Zeitschrift
Zu den Favoriten
211

Multiseed Lossless Filtration
Kucherov, Gregory ; Noé, Laurent ; Roytberg, Mikhail, A. ; et al.
IEEE/ACM Transactions on Computational Biology and Bioinformatics. 2(1):51-61

ACM: F.: Theory of Compu... F.2: ANALYSIS OF ALGORIT... F.2.2: Nonnumerical Algo... F.2.2.3: Pattern matchin... ACM: G.: Mathematics of... G.2: DISCRETE MATHEMATIC... …
Zeitschrift
Zu den Favoriten
212

Efficient assembly consensus algorithms for divergent contig sets
Chateau, Annie ; Davot, Tom ; Lafond, Manuel
In Computational Biology and Chemistry August 2021 93

Fachzeitschrift
Zu den Favoriten
213

On Implementing Stabilizing Leader Election with Weak Assumptions on Network Dynamics
Altisen, Karine ; Devismes, Stéphane ; Durand, Anaïs ; et al.
Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing. :21-31

pseudo-stabilization sources [INFO.INFO-DC]Computer S... sinks speculation leader election …
Fachzeitschrift
Zu den Favoriten
214

Convexifying Star-Shaped Polygons
Everett, Hazel ; Lazard, Sylvain ; Robbins, Steve ; et al.
10th Canadian Conference on Computational Geometry (CCCG'98). :10-12

Montreal, Canada ACM: F.: Theory of Compu... F.2: ANALYSIS OF ALGORIT... ACM: I.: Computing Metho... I.1: SYMBOLIC AND ALGEBR... I.1.2: Algorithms …
Konferenz
Zu den Favoriten
215

From Crossing-Free Graphs on Wheel Sets to Embracing Simplices and Polytopes with Few Vertices: From crossing-free graphs on wheel sets to embracing simplices and polytopes with few vertices
Alexander Pilz ; Emo Welzl ; Manuel Wettstein ; et al.
Leibniz International Proceedings in Informatics (LIPIcs), 77
33rd International Symposium on Computational Geometry (SoCG 2017)

Computational Geometry (... FOS: Computer and inform... geometric graph Analysis of algorithms a... Graph representations (g... Enumeration in graph the... …
Fachzeitschrift
Zu den Favoriten
216

On those multiplicative subgroups of $${\mathbb F}_{2^n}^*$$ which are Sidon sets and/or sum-free sets: On those multiplicative subgroups of \({\mathbb F}_{2^n}^\ast\) which are Sidon sets and/or sum-free sets
Sihem Mesnager ; Claude Carlet ; Laboratoire Analyse, Géométrie et Applications (LAGA) ; et al.
Journal of Algebraic Combinatorics. 55:43-59

Analysis of algorithms a... 02 engineering and techn... APN exponents 01 natural sciences Arithmetic combinatorics higher degree uniformity …
Fachzeitschrift
Zu den Favoriten
217

Algorithm for filling curves on surfaces
Monika Kudlinska
Geometriae Dedicata. 208:49-59

Fundamental group, prese... Dehn-Thurston coordinate... Analysis of algorithms a... Geometric Topology (math... 06 humanities and the ar... 01 natural sciences …
Fachzeitschrift
Zu den Favoriten
218

Expected Size of the 3-Dimensional Delaunay Triangulation of Random Points on a Surface
Taille moyenne de la triangulation 3D de Delaunay de points aléatoirement distribués sur une surface
Duménil, Charles ; Geometric Algorithms and Models Beyond the Linear and Euclidean realm (GAMBLE) ; Centre Inria de l'Université de Lorraine ; et al.
Computational Geometry [cs.CG]. Université de Lorraine, 2022. English. ⟨NNT : 2022LORR0050⟩

Computational geometry Empty Region Graph Poisson Point Process Generic Surface 3D-Delaunay Triangulatio... Géométrie algorithmique... …
Dissertation
Zu den Favoriten
219

An Axiomatic Approach to Time-Dependent Shortest Path Oracles
Kontogiannis, Spyros ; Wagner, Dorothea ; Zaroliagis, Christos
Algorithmica. 84(3):815-870

Fachzeitschrift
Zu den Favoriten
220

On the optimality of pseudo-polynomial algorithms for integer programming
Fomin, Fedor V. ; Panolan, Fahad ; Ramanujan, M. S. ; et al.
Mathematical Programming: A Publication of the Mathematical Optimization Society. :1-33

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

Filter