Zobrazeno 1 - 10
of 37
pro vyhledávání: '"Antichaînes"'
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
CASPARD, Nathalie
Publikováno v:
Mathématiques & Sciences Humaines; 2010, Vol. 2 Issue 190, p19-40, 22p
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Nathalie Caspard
Publikováno v:
Mathématiques et sciences humaines. :19-40
L’un des nombreux domaines dans lesquels Bruno Leclerc a travaillé et publié est celui des ensembles ordonnés. Plus précisément, il s’est fortement intéressé à des propriétés d’ensembles ordonnés relatives à des sous-structures bien
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1d13d35d0e17d423cdca6f2f78165a73
https://doi.org/10.4000/msh.11716
https://doi.org/10.4000/msh.11716
Publikováno v:
Ensembles Ordonnés finis: Concepts, Résultats et Usages; 2007, p109-132, 24p
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
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