Zobrazeno 1 - 10
of 21
pro vyhledávání: '"Grégoire Dooms"'
Publikováno v:
Constraints. 14:294-324
Visualization is often invaluable to understand the behavior of optimization algorithms, identify their bottlenecks or pathological behaviors, and suggest remedial techniques. Yet developing visualizations is often a tedious activity requiring signif
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f2491b17a89ff0dd3ad1fafd8bfe93c0
https://doi.org/10.1007/s10601-008-9063-y
https://doi.org/10.1007/s10601-008-9063-y
Autor:
M. de Tourtchaninoff, G. Auberttulkens, Paul Mahieu, Grégoire Dooms, B Deconinck, Philippe Hantson, Jean-Michel Guerit, Jean-Marie Brucher
Publikováno v:
European Neurology. 33:212-217
A 48-year-old woman was referred from Zaire with suspected rabies encephalitis. Survival was 34 days after the onset of symptoms and the diagnosis of rabies was ultimately proven after brain autopsy. Serial neurophysiological investigations, includin
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f56c267d20ffd1ce81a7ad9d13bc4313
https://doi.org/10.1159/000116939
https://doi.org/10.1159/000116939
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783540898115
CSCLP
CSCLP
Graph pattern matching is a central application in many fields. In various areas, the structure of the pattern can only be approximated and exact matching is then too accurate. We focus here on approximations declared by the user within the pattern (
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::adabfd3d1623d7ecf59301caf356cec9
https://hdl.handle.net/2078.1/67626
https://hdl.handle.net/2078.1/67626
Autor:
Pascal Van Hentenryck, Grégoire Dooms
Publikováno v:
Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems ISBN: 9783540681540
CPAIOR
CPAIOR
Anticipatory algorithms for online stochastic optimization have been shown very effective in a variety of areas, including logistics, reservation systems, and scheduling. For such applications which typically feature purely exogenous uncertainty, the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4015946b66e134b685c936c46dcbaca5
https://doi.org/10.1007/978-3-540-68155-7_8
https://doi.org/10.1007/978-3-540-68155-7_8
Publikováno v:
Principles and Practice of Constraint Programming – CP 2007 ISBN: 9783540749691
CP
CP
Visualization is often invaluable to understand the behavior of optimization algorithms, identify their bottlenecks or pathological behaviors, and suggest remedies. Yet developing visualizations is a tedious activity requiring significant time and ex
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c0784dd666ff317c6d6cd9724ed8525d
https://doi.org/10.1007/978-3-540-74970-7_21
https://doi.org/10.1007/978-3-540-74970-7_21
Autor:
Grégoire Dooms, Irit Katriel
Publikováno v:
Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems ISBN: 9783540723967
CPAIOR
CPAIOR
We develop filtering algorithms for the Weight-Bounded Spanning Tree (WBST(G,T,I,W)) constraint, which is defined on undirected graph variables Gand T, a scalar variable Iand a vector of scalar variables W. It specifies that Tis a spanning tree of Gw
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::73d7e58dcd5edeb7c031692199d9bd70
https://doi.org/10.1007/978-3-540-72397-4_5
https://doi.org/10.1007/978-3-540-72397-4_5
Autor:
Grégoire Dooms, Irit Katriel
Publikováno v:
Principles and Practice of Constraint Programming-CP 2006 ISBN: 9783540462675
CP
CP
The paper introduces the MST(G,T,W) constraint, which is specified on two graph variables G and T and a vector W of scalar variables. The constraint is satisfied if T is a minimum spanning tree of G, where the edge weights are specified by the entrie
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::70310e23f8ae82611643b729d7fe8608
https://doi.org/10.1007/11889205_13
https://doi.org/10.1007/11889205_13
Publikováno v:
Lecture Notes in Computer Science, Vol. 3389, p. 237-250 (2005)
Multiparadigm Programming in Mozart/Oz ISBN: 9783540250791
MOZ
Multiparadigm Programming in Mozart/Oz ISBN: 9783540250791
MOZ
The analysis of biochemical networks consists in studying the interactions between biological entities cooperating in complex cellular processes. To facilitate the expression of analyses and their computation, we introduced CP(BioNet), a constraint p
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6c60a7b209755277f5bd5924da36f92f
https://hdl.handle.net/2078.1/60992
https://hdl.handle.net/2078.1/60992
Publikováno v:
Principles and Practice of Constraint Programming-CP 2005 ISBN: 9783540292388
CP
Lecture Notes in Computer Science, Vol. 3709, p. 211-225 (2005)
CP
Lecture Notes in Computer Science, Vol. 3709, p. 211-225 (2005)
In an increasing number of domains such as bioinformatics, combinatorial graph problems arise. We propose a novel way to solve these problems, mainly those that can be translated to constrained subgraph finding. Our approach extends constraint progra
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0fe979db21101683b0f8afc179c21148
https://doi.org/10.1007/11564751_18
https://doi.org/10.1007/11564751_18