


default search action
Robert Proulx
Person information
Refine list

refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2014
- [j9]Nabila Nouaouria, Mounir Boukadoum, Robert Proulx:
Enhanced Global Best Particle Swarm Classification. Int. J. Softw. Sci. Comput. Intell. 6(3): 1-15 (2014) - [j8]Nabila Nouaouria, Mounir Boukadoum, Robert Proulx:
A Particle Swarm Optimization Approach for Reuse Guided Case Retrieval. Int. J. Softw. Sci. Comput. Intell. 6(3): 16-30 (2014) - [c9]Nabila Nouaouria
, Mounir Boukadoum
, Robert Proulx:
Position update mechanisms for enhanced particle swarm classification. ICCI*CC 2014: 48-52 - [c8]Nabila Nouaouria
, Mounir Boukadoum
, Robert Proulx:
Enhanced Particle Swarm Optimization algorithm with resuse guided retrieval capabilities. ICCI*CC 2014: 392-399 - 2013
- [j7]Nabila Nouaouria
, Mounir Boukadoum
, Robert Proulx:
Particle swarm classification: A survey and positioning. Pattern Recognit. 46(7): 2028-2044 (2013) - 2011
- [j6]Sébastien Hélie, Robert Proulx, Bernard Lefebvre:
Bottom-up learning of explicit knowledge using a Bayesian algorithm and a new Hebbian learning rule. Neural Networks 24(3): 219-232 (2011)
2000 – 2009
- 2007
- [c7]François Ménard, Robert Proulx:
Overcoming the digital divide in rural areas serving broadband profitably to as few as 25 subscribers. AccessNets 2007: 1-6 - [c6]Sylvain Chartier
, Gyslain Giguère, Patrice Renaud, Jean-Marc Lina, Robert Proulx:
FEBAM: A Feature-Extracting Bidirectional Associative Memory. IJCNN 2007: 1679-1684 - 2006
- [j5]Sébastien Hélie, Gyslain Giguère, Denis Cousineau
, Robert Proulx:
Using knowledge partitioning to investigate the psychological plausibility of mixtures of experts. Artif. Intell. Rev. 25(1-2): 119-138 (2006) - [j4]Sébastien Hélie, Sylvain Chartier
, Robert Proulx:
Are unsupervised neural networks ignorant? Sizing the effect of environmental distributions on unsupervised learning. Cogn. Syst. Res. 7(4): 357-371 (2006) - [c5]Guy Desjardins, Robert Proulx, Robert Godin:
An Auto-Associative Neural Network for Information Retrieval. IJCNN 2006: 3492-3498 - 2005
- [j3]Sylvain Chartier
, Robert Proulx:
NDRAM: nonlinear dynamic recurrent associative memory for learning bipolar and nonbipolar correlated patterns. IEEE Trans. Neural Networks 16(6): 1393-1400 (2005) - [c4]Sylvain Chartier
, Sébastien Hélie, Mounir Boukadoum
, Robert Proulx:
SCRAM: statistically converging recurrent associative memory. IJCNN 2005: 723-728 - [c3]Guy Desjardins, Robert Godin, Robert Proulx:
A self-organizing map for concept classification in information retrieval. IJCNN 2005: 1570-1574 - 2004
- [c2]Sébastien Hélie, Sylvain Chartier, Robert Proulx:
Applying Fuzzy Logic to Neural Modeling. ICCM 2004: 352-353 - 2002
- [j2]Patrice Renaud, Stéphane Bouchard
, Robert Proulx:
Behavioral avoidance dynamics in the presence of a virtual spider. IEEE Trans. Inf. Technol. Biomed. 6(3): 235-243 (2002)
1990 – 1999
- 1999
- [c1]Sylvain Chartier, Robert Proulx:
A self-scaling procedure in unsupervised correlational neural networks. IJCNN 1999: 1092-1096 - 1996
- [j1]Jean Bégin, Robert Proulx:
Categorization in unsupervised neural networks: the Eidos model. IEEE Trans. Neural Networks 7(1): 147-154 (1996)
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 2025-03-04 22:24 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint