Serveur d'exploration sur l'Université de Trèves

Attention, ce site est en cours de développement !
Attention, site généré par des moyens informatiques à partir de corpus bruts.
Les informations ne sont donc pas validées.

Le cluster algorithm - problem

Terms

6algorithm
9problem
2partition
2optimum
2cost
2chromatic
3approximation
8new

Associations

Freq.WeightAssociation
33algorithm - problem
22partition - problem
22optimum - problem
22optimum - partition
22cost - problem
22cost - partition
22cost - optimum
22chromatic - problem
22chromatic - partition
22chromatic - optimum
22chromatic - cost
22approximation - problem
22algorithm - new
11new - problem

Documents par ordre de pertinence
000264 (1997) Klaus Jansen [Allemagne]Approximation results for the optimum cost chromatic partition problem
000255 (1997) Klaus Jansen [Allemagne]The optimum cost chromatic partition problem
000268 (1997) Klaus Jansen [Allemagne] ; Joachim Reiter [Allemagne]A new approximation algorithm for the register allocation problem
000030 (2010) Daniel Binkele-Raible [Allemagne] ; Henning Fernau [Allemagne]A Faster Exact Algorithm for the Directed Maximum Leaf Spanning Tree Problem
000040 (2009) Henning Fernau [Allemagne] ; Joachim Kneis [Allemagne] ; Dieter Kratsch [France] ; Alexander Langer [Allemagne] ; Mathieu Liedloff [France] ; Daniel Raible [Allemagne] ; Peter Rossmanith [Allemagne]An Exact Algorithm for the Maximum Leaf Spanning Tree Problem
000246 (1998) Christian Fecht [Allemagne] ; Helmut Seidl [Allemagne]Propagating differences: An efficient new fixpoint algorithm for distributive constraint systems
000010 (2011) Pinar Heggernes [Norvège] ; Daniel Meister [Allemagne] ; Udi Rotics [Israël]Computing the Clique-Width of Large Path Powers in Linear Time via a New Characterisation of Clique-Width
000025 (2010) Ljiljana Brankovic [Australie] ; Henning Fernau [Allemagne]Combining Two Worlds: Parameterised Approximation for Vertex Cover
000044 (2008) Anna Kasprzik [Allemagne]A Learning Algorithm for Multi-dimensional Trees, or: Learning Beyond Context-Freeness
000055 (2008) Daniel Raible [Allemagne] ; Henning Fernau [Allemagne]A New Upper Bound for Max-2-SAT: A Graph-Theoretic Approach
000070 (2006) Ralph Bergmann (informaticien) [Allemagne] ; Babak Mougouie [Allemagne]Finding Similar Deductive Consequences – A New Search-Based Framework for Unified Reasoning from Cases and General Knowledge
000081 (2005) Hiromichi Fujisawa [Japon] ; Larry Kerschberg [États-Unis]Workshop on Information Just-in-Time (WIJIT2005): Seeking a New Knowledge Management Paradigm
000108 (2005) Guido Dedene [Belgique, Pays-Bas] ; Monique Snoeck [Belgique] ; Manu De Backer [Belgique] ; Wilfried Lemahieu [Belgique]New Generation E-Learning Technology by Web Services
000161 (2005) Markus Strohmaier [Autriche] ; Stefanie N. Lindstaedt [Autriche]Application of Knowledge Problem Patterns in Process Oriented Organizations
000204 (2002) Camil Demetrescu [Italie] ; Irene Finocchi [Italie] ; Giuseppe F. Italiano [Italie] ; Stefan N Her [Allemagne]Visualization in Algorithm Engineering: Tools and Techniques
000218 (2001) Valérie Gouranton [France] ; Pierre Réty [France] ; Helmut Seidl [Allemagne]Synchronized Tree Languages Revisited and New Applications
000222 (2001) Alberto Caprara [Italie]On the Practical Solution of the Reversal Median Problem
000247 (1998) Anna Slobodová [Allemagne]On the composition problem for OBDDs with multiple variable orders
000293 (1994) Klaus Jansen [Allemagne] ; Haiko Müller [Allemagne]The minimum broadcast time problem

Wicri

This area was generated with Dilib version V0.6.31.
Data generation: Sat Jul 22 16:29:01 2017. Site generation: Wed Feb 28 14:55:37 2024