Zobrazeno 1 - 6
of 6
pro vyhledávání: '"Houndji, Vinasetan Ratheil"'
Autor:
Kiossou, Harold Silvère, Schenk, Yannik, Docquier, Frédéric, Houndji, Vinasetan Ratheil, Nijssen, Siegfried, Schaus, Pierre
Globally increasing migration pressures call for new modelling approaches in order to design effective policies. It is important to have not only efficient models to predict migration flows but also to understand how specific parameters influence the
Externí odkaz:
http://arxiv.org/abs/2006.03560
Autor:
Houetohossou, Sèton Calmette Ariane, Houndji, Vinasetan Ratheil, Hounmenou, Castro Gbêmêmali, Sikirou, Rachidatou, Kakaï, Romain Lucas Glele
Publikováno v:
In Artificial Intelligence in Agriculture September 2023 9:46-60
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:
Houndji, Vinasetan Ratheil
Constraint Programming (CP) is a paradigm derived from artificial intelligence, operational research and algorithmics that can be used to solve combinatorial problems. CP solves problems by interleaving search (assign a value to an unassigned variabl
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______1493::c3a4841775233623f10e95a505459023
https://hdl.handle.net/2078.1/186333
https://hdl.handle.net/2078.1/186333
Autor:
Houndji, Vinasetan Ratheil
Publikováno v:
Constraints: An International Journal; Oct2018, Vol. 23 Issue 4, p481-482, 2p
Autor:
Thomas, Charles
This thesis presents the application of several constraint programming techniques to combinatorial problems. In particular, hybrid scheduling and routing problems such as Dial-A-Ride Problems (DARP) are explored. A variant of this problem, the Patien
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::603ad274cc500bdbd2b5448674a441d2
https://hdl.handle.net/2078.1/274377
https://hdl.handle.net/2078.1/274377