All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Page 1

Displaying 1 – 8 of 8

Showing per page

Heuristic and metaheuristic methods for computing graph treewidth

François Clautiaux, Aziz Moukrim, Stéphane Nègre, Jacques Carlier (2004)

RAIRO - Operations Research - Recherche Opérationnelle

The notion of treewidth is of considerable interest in relation to NP-hard problems. Indeed, several studies have shown that the tree-decomposition method can be used to solve many basic optimization problems in polynomial time when treewidth is bounded, even if, for arbitrary graphs, computing the treewidth is NP-hard. Several papers present heuristics with computational experiments. For many graphs the discrepancy between the heuristic results and the best lower bounds is still very large. The...

Heuristic and metaheuristic methods for computing graph treewidth

François Clautiaux, Aziz Moukrim, Stéphane Nègre, Jacques Carlier (2010)

RAIRO - Operations Research

The notion of treewidth is of considerable interest in relation to NP-hard problems. Indeed, several studies have shown that the tree-decomposition method can be used to solve many basic optimization problems in polynomial time when treewidth is bounded, even if, for arbitrary graphs, computing the treewidth is NP-hard. Several papers present heuristics with computational experiments. For many graphs the discrepancy between the heuristic results and the best lower bounds is still very large....

Hierarchical text categorization using fuzzy relational thesaurus

Domonkos Tikk, Jae Dong Yang, Sun Lee Bang (2003)

Kybernetika

Text categorization is the classification to assign a text document to an appropriate category in a predefined set of categories. We present a new approach for the text categorization by means of Fuzzy Relational Thesaurus (FRT). FRT is a multilevel category system that stores and maintains adaptive local dictionary for each category. The goal of our approach is twofold; to develop a reliable text categorization method on a certain subject domain, and to expand the initial FRT by automatically added...

Histoires de fichiers

Jean Françon (1978)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

Hitting time of a corner for a reflected diffusion in the square

F. Delarue (2008)

Annales de l'I.H.P. Probabilités et statistiques

We discuss the long time behavior of a two-dimensional reflected diffusion in the unit square and investigate more specifically the hitting time of a neighborhood of the origin. We distinguish three different regimes depending on the sign of the correlation coefficient of the diffusion matrix at the point 0. For a positive correlation coefficient, the expectation of the hitting time is uniformly bounded as the neighborhood shrinks. For a negative one, the expectation explodes in a polynomial way...

Currently displaying 1 – 8 of 8

Page 1