• Suche: "F.2.2: Nonnumerical Algorithms and Problems"

Treffer 101 - 120 von 321

101

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
102

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
103

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
104

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
105

Carpooling : the 2 Synchronization Points Shortest Paths Problem
Bit-Monnot, Arthur ; Artigues, Christian ; Huguet, Marie-José ; et al.
13th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS), Sep 2013, Sophia Antipolis, France. 12 p, ⟨10.4230/OASIcs.ATMOS.2013.150⟩

Sophia Antipolis, France Dynamic Carpooling Shortest Path Problem Synchronized Paths 'G.2.1 Combinatorics', '... [INFO.INFO-RO]Computer S... …
Konferenz
Zu den Favoriten
106

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
107

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
108

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
109

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
110

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
111

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
112

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 …
Konferenz
Zu den Favoriten
113

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... …
Konferenz
Zu den Favoriten
114

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 [...
Konferenz
Zu den Favoriten
115

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 …
Konferenz
Zu den Favoriten
116

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... …
Konferenz
Zu den Favoriten
117

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
Zu den Favoriten
118

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... …
Konferenz
Zu den Favoriten
119

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
Zu den Favoriten
120

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... …
Zeitschrift
Zu den Favoriten
Suchwerkzeuge: RSS-Feed abonnieren Diese Suche als E-Mail versenden Suche speichern

Filter