The following pages link to Pascale Kuntz (Q617899):
Displaying 13 items.
- An efficient algorithm for computing the distance between close partitions (Q617900) (← links)
- A contribution to the study of the metric and Euclidean structures of dissimilarities (Q676499) (← links)
- An evolutionary approach with diversity guarantee and well-informed grouping recombination for graph coloring (Q976050) (← links)
- A search space ``cartography'' for guiding graph coloring heuristics (Q1040976) (← links)
- A stochastic heuristic visualising graph clusters in a bi-dimensional space prior to partitioning (Q1854904) (← links)
- The growth and form of tunnelling networks in ants (Q2202378) (← links)
- Minimizing crossings in hierarchical digraphs with a hybridized genetic algorithm (Q2491331) (← links)
- (Q2770500) (← links)
- INFORMED REACTIVE TABU SEARCH FOR GRAPH COLORING (Q2853412) (← links)
- Reduction of Redundant Rules in Statistical Implicative Analysis (Q5302526) (← links)
- (Q5392496) (← links)
- The Topological Fortress of Termites (Q5503781) (← links)
- Variations on a tree (Q6563992) (← links)
