Showing 121 - 140 of 3,807

121

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
Save to List
122

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...
Conference
Save to List
123

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...
Conference
Save to List
124

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...
Conference
Save to List
125

Le rôle de la dimension dans la recherche de chemins optimaux dans les petits mondes
Giakkoupis, George ; Schabanel, Nicolas ; Laboratoire d'informatique Algorithmique : Fondements et Applications (LIAFA) ; et al.
13es Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel), 2011, Cap Estérel, France. 4 p

Cap Estérel, France small worlds social networks peer-to-peer networks decentralized search optimal paths
Conference
Save to List
126

Weighted random generation of context-free languages: Analysis of collisions in random urn occupancy models
Gardy, Danièle ; Ponty, Yann ; Parallélisme, Réseaux, Systèmes, Modélisation (PRISM) ; et al.
GASCOM - 8th conference on random generation of combinatorial structures - 2010, LACIM, UQAM, Sep 2010, Montréal, Canada. 14pp

Montréal, Canada Coupon collector Birthday paradox Random generation Context-free languages ACM: G.: Mathematics of...
Conference
Save to List
127

On the Complexity of Sets of Free Lines and Line Segments Among Balls in Three Dimensions
Glisse, Marc ; Lazard, Sylvain ; Geometric computing (GEOMETRICA) ; et al.
26th annual symposium on Computational geometry - SoCG 2010, Jun 2010, Snowbird, Utah, United States. ⟨10.1145/1810959.1810969⟩

Snowbird, Utah, United S... ACM: F.: Theory of Compu... F.2: ANALYSIS OF ALGORIT... F.2.2: Nonnumerical Algo... [INFO.INFO-CG]Computer S... Computational Geometry [...
Conference
Save to List
128

Isosurface extraction and interpretation on very large datasets in geophysics
Dupuy, Guilhem ; Jobard, Bruno ; Guillon, Sébastien ; et al.
ACM Solid and Physical Modeling Symposium, Jun 2008, New York, United States

New York, United States Geo-scientific applicati... Collaborative and distri... Geometric computation an... ACM: I.: Computing Metho... I.3: COMPUTER GRAPHICS
Conference
Save to List
129

On the Worst-Case Complexity of TimSort
Auger, Nicolas ; Jugé, Vincent ; Nicaud, Cyril ; et al.
26th Annual European Symposium on Algorithms (ESA 2018). :4-4

Helsinki, Finland Sorting algorithms Merge sorting algorithms Analysis of al-gorithms TimSort ACM: F.: Theory of Compu...
Conference
Save to List
130

Optimal Algorithms for Compact Linear Layouts
Willem Sonke ; Eric Verbeek ; Wouter Meulemans ; et al.
2018 IEEE Pacific Visualization Symposium (PacificVis). :1-10

Graph/Network Data Geometry based Technique... 11. Sustainability Folding Linear layouts F.2.2 [Analysis of Algor...
Academic journal
Save to List
131

Detecting dense communities in large social and information networks with the Core & Peel algorithm
Pellegrini, Marco ; Geraci, Filippo ; Baglioni, Miriam

Computer Science - Socia... Computer Science - Data... Physics - Physics and So... F.2.2 Nonnumerical Algor...
Report
Save to List
132

A best-compromise bicriteria scheduling algorithm for malleable tasks
Dutot, Pierre-François ; Trystram, Denis ; Parallel algorithms and load sharing (APACHE) ; et al.
Workshop on Efficient Algorithms, May 2005, Santorini Island, Greece

Scheduling Moldable Bi-Criteria ACM: F.: Theory of Compu... F.2: ANALYSIS OF ALGORIT... F.2.2: Nonnumerical Algo...
Conference
Save to List
133

Note: Regular languages with no conflicts (forbidden pairs) are regular but have exponential size DFA
Cornet, Alexis ; Laforest, Christian ; Laboratoire d'Informatique, de Modélisation et d'optimisation des Systèmes (LIMOS) ; et al.
[Research Report] LIMOS (UMR CNRS 6158), université Clermont Auvergne, France 2016

Regular languages DFA forbidden pairs conflicts ACM: F.: Theory of Compu... F.2: ANALYSIS OF ALGORIT...
Report
Save to List
134

Building Efficient and Compact Data Structures for Simplicial Complexe
Boissonnat, Jean-Daniel ; Srikanta, Karthik C. ; Tavenas, Sébastien ; et al.
Algorithmica, 2016, ⟨10.1007/s00453-016-0207-y⟩

NP-hard Automaton Compact data structures Simplicial complex ACM: F.: Theory of Compu... F.2: ANALYSIS OF ALGORIT...
Journal
Save to List
135

Infinite Unlimited Churn
Foreback, Dianne ; Nesterenko, Mikhail ; Tixeuil, Sébastien ; et al.
[Research Report] LIP6 - Laboratoire d'Informatique de Paris 6; Kent State University. 2016

ACM: C.: Computer System... C.2: COMPUTER-COMMUNICAT... C.2.1: Network Architect... C.2.2: Network Protocols C.2.3: Network Operation... C.2.4: Distributed Syste...
Report
Save to List
136

Optimal Mobile Byzantine Fault Tolerant Distributed Storage
Bonomi, Silvia ; del Pozzo, Antonella ; Potop-Butucaru, Maria ; et al.
[Research Report] UPMC - Université Paris 6 Pierre et Marie Curie. 2016

ACM: F.: Theory of Compu... F.2: ANALYSIS OF ALGORIT... F.2.2: Nonnumerical Algo... F.2.2.0: Complexity of p... F.2.2.1: Computations on... ACM: D.: Software
Report
Save to List
137

A randomized, efficient algorithm for MAX2SAT
Dumitrescu, Cristian ; Chercheur indépendant

NP-complete problems MAX2SAT ACM: G.: Mathematics of... G.2: DISCRETE MATHEMATIC... ACM: F.: Theory of Compu... F.2: ANALYSIS OF ALGORIT...
Electronic Resource
Save to List
138

Where to begin: on pattern language entry points
Lukas Reinfurt ; Michael Falkenthal ; Frank Leymann ; et al.
SICS Software-Intensive Cyber-Physical Systems. 35:127-139

Nonnumerical Algorithms... Pattern Languages 4. Education Software Engineering Sof... Discrete Mathematics Gra... Internet of Things
Academic journal
Save to List
139

Hierarchical Overlap Graph
Cazaux, Bastien ; Rivals, Eric ; Méthodes et Algorithmes pour la Bioinformatique (MAB) ; et al.
Information Processing Letters. 155:105862-105862

Aho-Corasik greedy superstring suffix overlap graph assembly
Journal
Save to List
140

Master-slave Tasking on Heterogeneous Processors
Dutot, Pierre-François ; Parallel algorithms and load sharing (APACHE) ; Informatique et Distribution (ID-IMAG) ; et al.
International Parallel and Distributed Processing Symposium, Apr 2003, Nice, France

Scheduling Master-Slave Tasking Algorithm ACM: F.: Theory of Compu... F.2: ANALYSIS OF ALGORIT... F.2.2: Nonnumerical Algo...
Conference
Save to List

Filter