default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPhilippe Devienne
Person information
- affiliation: LIFL Lille, France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j6]Hammouda Elbez
, Mohammed Kamel Benhaoua, Philippe Devienne, Pierre Boulet:
Progressive compression and weight reinforcement for spiking neural networks. Concurr. Comput. Pract. Exp. 34(11) (2022)- 2021
- [c23]Hammouda Elbez, Mohammed Kamel Benhaoua, Philippe Devienne, Pierre Boulet:
VS2N : Interactive Dynamic Visualization and Analysis Tool for Spiking Neural Networks. CBMI 2021: 1-6
2010 – 2019
- 2019
- [j5]Pierre Falez, Pierre Tirilly, Ioan Marius Bilasco, Philippe Devienne, Pierre Boulet:
Unsupervised visual feature learning with spike-timing-dependent plasticity: How far are we from traditional feature learning approaches? Pattern Recognit. 93: 418-429 (2019) - [c22]Pierre Falez, Pierre Tirilly, Ioan Marius Bilasco, Philippe Devienne, Pierre Boulet:
Multi-layered Spiking Neural Network with Target Timestamp Threshold Adaptation and STDP. IJCNN 2019: 1-8 - [p1]Mahyar Shahsavari, Philippe Devienne, Pierre Boulet:
Spiking Neural Computing in Memristive Neuromorphic Platforms. Handbook of Memristor Networks 2019: 691-728 - [i3]Pierre Falez, Pierre Tirilly, Ioan Marius Bilasco, Philippe Devienne, Pierre Boulet:
Unsupervised Visual Feature Learning with Spike-timing-dependent Plasticity: How Far are we from Traditional Feature Learning Approaches? CoRR abs/1901.04392 (2019) - [i2]Pierre Falez, Pierre Tirilly, Ioan Marius Bilasco, Philippe Devienne, Pierre Boulet:
Multi-layered Spiking Neural Network with Target Timestamp Threshold Adaptation and STDP. CoRR abs/1904.01908 (2019) - 2018
- [c21]Pierre Falez, Pierre Tirilly, Ioan Marius Bilasco, Philippe Devienne, Pierre Boulet:
Mastering the Output Frequency in Spiking Neural Networks. IJCNN 2018: 1-8 - 2016
- [i1]Mazdak Fatahi, Mahmood Ahmadi, Mahyar Shahsavari, Arash Ahmadi, Philippe Devienne:
evt_MNIST: A spike based version of traditional MNIST. CoRR abs/1604.06751 (2016)
2000 – 2009
- 2004
- [c20]Ammar Aljer, Philippe Devienne:
Co-Design and Refinement for Safety Critical Systems. DFT 2004: 78-86 - 2003
- [c19]Ammar Aljer, Philippe Devienne, Sophie Tison, Jean-Louis Boulanger, Georges Mariano:
BHDL: Circuit Design in B. ACSD 2003: 241-242 - 2000
- [j4]Jean-Marc Talbot, Philippe Devienne, Sophie Tison:
Generalized Definite Set Constraints. Constraints An Int. J. 5(1/2): 161-202 (2000)
1990 – 1999
- 1998
- [c18]Philippe Devienne, Jean-Marc Talbot, Sophie Tison:
Co-definite Set Constraints with Membership Expressions. IJCSLP 1998: 25-39 - [c17]Philippe Devienne, Anne Parrain, Patrick Taillibert, S. Varennes:
Source-to-source Prolog Program Compression. IJCSLP 1998: 205-219 - 1997
- [c16]Philippe Devienne, Jean-Marc Talbot, Sophie Tison:
Solving Classes of Set Constraints with Tree Automata. CP 1997: 62-76 - [c15]Jean-Marc Talbot, Sophie Tison, Philippe Devienne:
Set-Based Analysis for Logic Programming and Tree Automata. SAS 1997: 127-140 - 1996
- [j3]Philippe Devienne, Patrick Lebègue, Anne Parrain, Jean-Christophe Routier, Jörg Würtz:
Smallest Horn Clause Programs. J. Log. Program. 27(3): 227-267 (1996) - 1994
- [c14]Philippe Devienne, Patrick Lebègue, Jean-Christophe Routier, Jörg Würtz:
One Binary Horn Clause is Enough. STACS 1994: 21-32 - 1993
- [j2]Philippe Devienne, Patrick Lebègue, Max Dauchet:
Weighted Systems of Equations. Theor. Comput. Sci. 119(1): 39-62 (1993) - [c13]Philippe Devienne, Patrick Lebègue, Jean-Christophe Routier:
The Emptiness Problem of One Binary Recursive Horn Clause is Undecidable. ILPS 1993: 250-265 - [c12]Philippe Devienne, Patrick Lebègue, Jean-Christophe Routier:
Halting Problem of One Binary Horn Clause is Undecidable. STACS 1993: 48-57 - 1992
- [c11]Philippe Devienne, Patrick Lebègue, Jean-Christophe Routier:
Halting Problem of One Binary Horn Clause id Undecidable. Structural Complexity and Recursion-theoretic methods in Logic-Programming 1992: 5-14 - [c10]Christophe Lecoutre, Philippe Devienne, Patrick Lebègue:
Termination induction by means of an abstract OLDT resolution. JFPL 1992: 353-373 - [c9]Anne Parrain, Philippe Devienne, Patrick Lebègue:
Towards Optimization of Full Prolog Programs Guided by Abstract Interpretation. LOPSTR 1992: 228-241 - [c8]Philippe Devienne, Patrick Lebègue, Jean-Christophe Routier:
Weighted Systems Revisited. WSA 1992: 163-173 - [c7]Anne Parrain, Philippe Devienne, Patrick Lebègue:
Towards Optimization of Full Prolog Programs guided by Abstract Interpretation. WSA 1992: 295-303 - [e1]Jean-Paul Delahaye, Philippe Devienne, Philippe Mathieu, Pascal Yim:
JFPL'92, 1ères Journées Francophones de Programmation Logique, 25-27 Mai 1992, Lille, France. 1992 [contents] - 1991
- [c6]Christophe Lecoutre, Philippe Devienne, Patrick Lebègue:
Abstract Interpretation and Recursive Behaviour of Logic Programs. LOPSTR 1991: 147-166 - [c5]Anne Parrain, Philippe Devienne, Patrick Lebègue:
Prolog Program Transformations and Meta-Interpreters. LOPSTR 1991: 238-251 - [c4]Christophe Lecoutre, Philippe Devienne, Patrick Lebègue:
Une analyse du comportement récursif de programmes Prolog par une interprétation abstraite. JTASPEFT/WSA 1991: 62-69 - [c3]Anne Parrain, Philippe Devienne, Patrick Lebègue:
Techniques de transformations de programmes Prolog généraux et validation de méta-interpréteurs. JTASPEFT/WSA 1991: 132-138 - 1990
- [j1]Philippe Devienne:
Weighted Graphs: A Tool for Studying the Halting Problem and Time Complexity in Term Rewriting Systems and Logic Programming. Theor. Comput. Sci. 75(1&2): 157-215 (1990)
1980 – 1989
- 1988
- [c2]Philippe Devienne:
WEIGHTED GRAPHS, A Tool for Expressing the Behavious of Recursive Rules in Logic Programming. FGCS 1988: 397-404 - 1986
- [c1]Philippe Devienne, Patrick Lebègue:
Weighted Graphs: A Tool for Logic Programming. CAAP 1986: 100-111
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-04-24 23:16 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:
