default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDavid Allouche
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c10]Samuel Buchet, David Allouche, Simon de Givry, Thomas Schiex:
Bi-objective Discrete Graphical Model Optimization. CPAIOR (1) 2024: 136-152- 2023
- [c9]Pierre Montalbano, David Allouche, Simon de Givry, George Katsirelos, Tomás Werner:
Virtual Pairwise Consistency in Cost Function Networks. CPAIOR 2023: 417-426 - 2022
- [c8]Abdelkader Beldjilali, Pierre Montalbano, David Allouche, George Katsirelos, Simon de Givry:
Parallel Hybrid Best-First Search. CP 2022: 7:1-7:10 - 2020
- [j9]Abdelkader Ouali, David Allouche, Simon de Givry, Samir Loudni, Yahia Lebbah, Lakhdar Loukil, Patrice Boizumault:
Variable neighborhood search for graphical model energy minimization. Artif. Intell. 278 (2020)
2010 – 2019
- 2019
- [j8]Antoine Charpentier, David Mignon, Sophie Barbe
, Juan Cortés, Thomas Schiex, Thomas Simonson, David Allouche:
Variable Neighborhood Search with Cost Function Networks To Solve Large Computational Protein Design Problems. J. Chem. Inf. Model. 59(1): 127-136 (2019) - [i2]David Allouche:
Computation Protein Design instances with small tree-width: selection based on coarse approximated 3D average position volume. CoRR abs/1909.01803 (2019) - 2017
- [c7]Abdelkader Ouali, David Allouche, Simon de Givry, Samir Loudni, Yahia Lebbah, Lakhdar Loukil:
Iterative Decomposition Guided Variable Neighborhood Search for Graphical Model Energy Minimization. UAI 2017 - 2016
- [j7]David Allouche, Christian Bessiere, Patrice Boizumault, Simon de Givry, Patricia Gutierrez, Jimmy H. M. Lee, Ka Lun Leung, Samir Loudni, Jean-Philippe Métivier, Thomas Schiex, Yi Wu:
Tractability-preserving transformations of global cost functions. Artif. Intell. 238: 166-189 (2016) - [j6]Barry Hurley, Barry O'Sullivan, David Allouche, George Katsirelos, Thomas Schiex, Matthias Zytnicki, Simon de Givry:
Multi-language evaluation of exact solvers in graphical model discrete optimization. Constraints An Int. J. 21(3): 413-434 (2016) - [j5]Seydou Traoré, Kyle E. Roberts, David Allouche, Bruce Randall Donald, Isabelle André, Thomas Schiex, Sophie Barbe:
Fast search algorithms for computational protein design. J. Comput. Chem. 37(12): 1048-1058 (2016) - 2015
- [c6]David Allouche, Simon de Givry, George Katsirelos, Thomas Schiex, Matthias Zytnicki:
Anytime Hybrid Best-First Search with Tree Decomposition for Weighted CSP. CP 2015: 12-29 - [c5]Clément Viricel, David Simoncini, David Allouche, Simon de Givry, Sophie Barbe, Thomas Schiex:
Approximate Counting with Deterministic Guarantees for Affinity Computation. MCO (2) 2015: 165-176 - [i1]David Allouche, Christian Bessiere, Patrice Boizumault, Simon de Givry, Patricia Gutierrez, Jimmy H. M. Lee, Ka Lun Leung, Samir Loudni, Jean-Philippe Métivier, Thomas Schiex, Yi Wu:
Tractability and Decompositions of Global Cost Functions. CoRR abs/1502.02414 (2015) - 2014
- [j4]David Allouche, Isabelle André, Sophie Barbe, Jessica Davies, Simon de Givry, George Katsirelos, Barry O'Sullivan, Steven D. Prestwich, Thomas Schiex, Seydou Traoré:
Computational protein design as an optimization problem. Artif. Intell. 212: 59-79 (2014) - 2013
- [j3]Seydou Traoré, David Allouche, Isabelle André, Simon de Givry, George Katsirelos, Thomas Schiex, Sophie Barbe:
A new framework for computational protein design through cost function network optimization. Bioinform. 29(17): 2129-2136 (2013) - 2012
- [c4]David Allouche, Christian Bessiere, Patrice Boizumault, Simon de Givry, Patricia Gutierrez, Samir Loudni, Jean-Philippe Métivier, Thomas Schiex:
Filtering Decomposable Global Cost Functions. AAAI 2012: 407-413 - [c3]David Allouche, Seydou Traoré, Isabelle André, Simon de Givry, George Katsirelos, Sophie Barbe, Thomas Schiex:
Computational Protein Design as a Cost Function Network Optimization Problem. CP 2012: 840-849 - 2010
- [c2]David Allouche, Simon de Givry, Thomas Schiex:
Towards Parallel Non Serial Dynamic Programming for Solving Hard Weighted CSP. CP 2010: 53-60
2000 – 2009
- 2009
- [c1]Martí Sánchez-Fibla, David Allouche, Simon de Givry, Thomas Schiex:
Russian Doll Search with Tree Decomposition. IJCAI 2009: 603-608 - 2008
- [j2]Olivier Filangi, Yoann Beausse, Anthony Assi, Ludovic Legrand, Jean-Marc Larré, Véronique Martin, Olivier Collin, Christophe Caron, Hugues Leroy, David Allouche:
BioMAJ: a flexible framework for databanks synchronization and processing. Bioinform. 24(16): 1823-1825 (2008) - 2007
- [j1]Chris Cole, David Allouche, Frank Flens, Bernd Hübner, Thelinh Nguyen:
100GbE- Optical LAN Technologies [Applications & Practice]. IEEE Commun. Mag. 45(12): 12-19 (2007)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-05 21:35 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
