Showing 61 - 80 of 4,040

61

Polynomial Kernelizations for MIN F+PI 1 and MAX NP
Kratsch, Stefan ; Max-Planck-Institut für Informatik (MPII) ; Max-Planck-Gesellschaft ; et al.
26th International Symposium on Theoretical Aspects of Computer Science STACS 2009. :601-612

Freiburg, Germany parameterized complexity kernelization approximation algorithms ACM: F.: Theory of Compu... F.2: ANALYSIS OF ALGORIT...
Conference
Save to List
62

Generalized Attachment Models for the Genesis of Graphs with High Clustering Coefficient
Gustedt, Jens ; Algorithms for the Grid (ALGORILLE) ; INRIA Lorraine ; et al.
Santo Fortunato and Giuseppe Mangioni and Ronaldo Menezes and Vincenzo Nicosia. Complex Networks - Results of the 2009 International Workshop on Complex Networks (CompleNet 2009). :99-113

attachment models random graph generation k-trees ACM: F.: Theory of Compu... F.2: ANALYSIS OF ALGORIT... F.2.2: Nonnumerical Algo...
Book
Save to List
63

More on change-making and related problems
Gao, Younan ; He, Meng ; Nekrich, Yakov ; et al.
Journal of Computer and System Sciences. 124:159-169

Frobenius problem FOS: Computer and inform... Combinatorial optimizati... Analysis of algorithms a... coin changing Coin changing
Academic journal
Save to List
64

The Voronoi Diagram of Three Lines
Everett, Hazel ; Lazard, Daniel ; Lazard, Sylvain ; et al.
23rd Annual Symposium on Computational Geometry (SoCG'07). :255-264

Gyeongju, South Korea quadric surface intersec... medial axis Voronoi diagram ACM: F.: Theory of Compu... F.2: ANALYSIS OF ALGORIT...
Conference
Save to List
65

Line transversals to disjoint balls
Borcea, Ciprian ; Goaoc, Xavier ; Petitjean, Sylvain ; et al.
23rd Annual ACM Symposium on Computational Geometry 2007 - SoCG'07. :245-254

Gyeongju, South Korea lines geometric transversal th... disjoint balls convexity Hessian
Conference
Save to List
66

An experimental validation of the PRO model for parallel and distributed computation
Essaïdi, Mohamed ; Gustedt, Jens ; Simulation, modeling and analysis of heterogeneous systems (SMASH) ; et al.
14th Euromicro International Conference on Parallel. :449-456

Montbeliard-Sochaux, Fra... ACM: D.: Software D.1: PROGRAMMING TECHNIQ... D.1.3: Concurrent Progra... D.1.3.0: Distributed pro... D.2: SOFTWARE ENGINEERIN...
Conference
Save to List
67

Hierarchical Scheduling for Moldable Tasks
Dutot, Pierre-François ; Parallel algorithms and load sharing (APACHE) ; Informatique et Distribution (ID-IMAG) ; et al.
Euro-Par. :302-311

Scheduling Hierarchical Algorithm ACM: F.: Theory of Compu... F.2: ANALYSIS OF ALGORIT... F.2.2: Nonnumerical Algo...
Conference
Save to List
68

Scheduling moldable {BSP} tasks
Dutot, Pierre-François ; Goldman, Alfredo ; Kon, Fabio ; et al.
11th Workshop on Job Scheduling Strategies for Parallel Processing. :157-172

Scheduling BSP Moldable ACM: F.: Theory of Compu... F.2: ANALYSIS OF ALGORIT... F.2.2: Nonnumerical Algo...
Conference
Save to List
69

Hadwiger and Helly-type theorems for disjoint unit spheres in R3
Cheong, Otfried ; Goaoc, Xavier ; Holmsen, Andreas ; et al.
21st Annual ACM Symposium on Computational Geometry 2005 (SoCG'05 ). :10-15

Pisa, Italy unit sphere unit ball line transversal Helly theorem Hadwiger theorem
Conference
Save to List
70

Automata Column: The Complexity of Reachability in Vector Addition Systems
Schmitz, Sylvain ; Verification in databases (DAHU) ; Laboratoire Spécification et Vérification [Cachan] (LSV) ; et al.
ACM SIGLOG News. 3(1):3-21

ACM: F.: Theory of Compu... F.2: ANALYSIS OF ALGORIT... F.2.2: Nonnumerical Algo... F.3: LOGICS AND MEANINGS... F.3.1: Specifying and Ve... [INFO.INFO-LO]Computer S...
Journal
Save to List
71

Efficiently navigating a random Delaunay triangulation
Broutin, Nicolas ; Devillers, Olivier ; Hemsley, Ross ; et al.
Random Structures and Algorithms. 49(1):95-136

random analysis point location routing Delaunay triangulation ACM: F.: Theory of Compu... F.2: ANALYSIS OF ALGORIT...
Journal
Save to List
72

This result is not available to guest users.

73

This result is not available to guest users.

74

This result is not available to guest users.

75

This result is not available to guest users.

76

This result is not available to guest users.

77

Formalizing Convex Hulls Algorithms
Formalisation d'algorithmes d'enveloppes convexes

Pichardie, David ; Bertot, Yves ; Logiciel : ANalyse et DEveloppement (Lande) ; et al.
TPHOLs 2001 - 14th International Conference Theorem Proving in Higher Order Logics. :346-361

Edinburgh, United Kingdo... ACM: F.: Theory of Compu... F.3: LOGICS AND MEANINGS... F.3.1: Specifying and Ve... F.4: MATHEMATICAL LOGIC... F.4.1: Mathematical Logi...
Conference
Save to List
78

Scheduling on hierarchical clusters using malleable tasks
Dutot, Pierre-François ; Trystram, Denis ; Parallel algorithms and load sharing (APACHE) ; et al.
Symposium on Parallel Algorithms and Architectures. :199-208

ACM: F.: Theory of Compu... F.2: ANALYSIS OF ALGORIT... F.2.2: Nonnumerical Algo... F.2.2.5: Sequencing and... [INFO.INFO-DC]Computer S... Distributed, Parallel, a...
Conference
Save to List
79

Conflict-Free Coloring Bounds on Open Neighborhoods: Conflict-free coloring bounds on open neighborhoods
Sriram Bhyravarapu ; Subrahmanyam Kalyanasundaram ; Rogers Mathew
Algorithmica. 84:2154-2185

Coloring of graphs and h... Graph theory (including... Analysis of algorithms a... 0102 computer and inform... 0101 mathematics Nonnumerical algorithms
Academic journal
Save to List
80

Analysis of the two-for-one swap heuristic for approximating the maximum independent set in a k-polymatroid: Analysis of the two-for-one swap heuristic for approximating the maximum independent set in a \(k\)-polymatroid
Adrian Calinescu ; Gruia Călinescu
Operations Research Letters. 59:107217

Combinatorial optimizati... matroid local optimization Analysis of algorithms Combinatorics in compute... Combinatorial aspects of...
Academic journal
Save to List

Filter