Zobrazeno 1 - 7
of 7
pro vyhledávání: '"antichaînes"'
Autor:
Dusart, Jérémie
Publikováno v:
Computer Science [cs]. Université Denis Diderot Paris 7, 2014. English
This thesis contains a global study on graph searches, introducing a new formal madel to study graph search.But also we study the applications of known graph searches such as LBFS (Lexicographic Breadth First Search), LDFS (Lexicographic Depth First
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______2592::8e8e371bb69adcd55cf9872c6f93bcec
https://hal.inria.fr/tel-01273352/file/thesisJDusart.pdf
https://hal.inria.fr/tel-01273352/file/thesisJDusart.pdf
Autor:
Dusart, Jérémie
Publikováno v:
Computer Science [cs]. Université Denis Diderot Paris 7, 2014. English
This thesis contains a global study on graph searches, introducing a new formal madel to study graph search.But also we study the applications of known graph searches such as LBFS (Lexicographic Breadth First Search), LDFS (Lexicographic Depth First
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::8e8e371bb69adcd55cf9872c6f93bcec
https://hal.inria.fr/tel-01273352
https://hal.inria.fr/tel-01273352
Autor:
Maquet, Nicolas
This work studies new algorithms and data structures that are useful in the context of program verification. As computers have become more and more ubiquitous in our modern societies, an increasingly large number of computer-based systems are conside
Autor:
Maquet, Nicolas P. P.
This work studies new algorithms and data structures that are useful in the context of program verification. As computers have become more and more ubiquitous in our modern societies, an increasingly large number of computer-based systems are conside
Autor:
Maquet, Nicolas
This work studies new algorithms and data structures that are useful in the context of program verification. As computers have become more and more ubiquitous in our modern societies, an increasingly large number of computer-based systems are conside
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______2101::88f4ea1a3b65817f8b755c5de990ba42
http://hdl.handle.net/2013/ULB-ETD:oai:ulb.ac.be:ETDULB:ULBetd-02162011-105751
http://hdl.handle.net/2013/ULB-ETD:oai:ulb.ac.be:ETDULB:ULBetd-02162011-105751
Publikováno v:
Order
Order, 1999, 15 (3), pp.221-246
Order, Springer Verlag, 1999, 15 (3), pp.221-246
Scopus-Elsevier
Order, 1999, 15 (3), pp.221-246
Order, Springer Verlag, 1999, 15 (3), pp.221-246
Scopus-Elsevier
Article dans revue scientifique avec comité de lecture.; We discuss bijections that relate families of chains in lattices associated to an order $P$ and families of interval orders defined on the ground set of $P$. Two bijections of this type have b
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::273941ef67df91c93c4ac1d36000ee1e
https://hal.inria.fr/inria-00549657
https://hal.inria.fr/inria-00549657
Autor:
Philippe Lenca, Fabrice Guillet
Publikováno v:
Journées du programme de recherches coordonnées: discrimination Symbolique-Numérique. Saint-Malo, France
Journées du programme de recherches coordonnées: discrimination Symbolique-Numérique. Saint-Malo, France, Oct 1993, Saint-Malo, France
HAL
Journées du programme de recherches coordonnées: discrimination Symbolique-Numérique. Saint-Malo, France, Oct 1993, Saint-Malo, France
HAL
International audience; On présente un algorithme de recherche d'antichaînes dans un produit direct d'ordres totaux et ses applications à l'extraction de connaissances.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::a510b64ac731aeeb61609bbf1b5d07b6
https://hal.archives-ouvertes.fr/hal-02269864
https://hal.archives-ouvertes.fr/hal-02269864