default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJean-Christophe Routier
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j10]Ellie Beauprez, Anne-Cécile Caron, Maxime Morge, Jean-Christophe Routier:
Délégation de lots de tâches pour la réduction de la durée moyenne de réalisation. Rev. Ouverte Intell. Artif. 4(2): 193-221 (2023)- [c41]Ellie Beauprez, Anne-Cécile Caron, Maxime Morge, Jean-Christophe Routier:
Consommation adaptative par négociation continue. JFSMA 2023: 21-30 - [c40]Ellie Beauprez, Anne-Cécile Caron
, Maxime Morge, Jean-Christophe Routier:
Adaptive Consumption by Continuous Negotiation. PAAMS 2023: 28-39 - 2022
- [j9]Quentin Baert, Anne-Cécile Caron, Maxime Morge, Jean-Christophe Routier, Kostas Stathis:
Un système multi-agent adaptatif pour la réallocation de tâches au sein d'un job MapReduce. Rev. Ouverte Intell. Artif. 3(5-6): 557-585 (2022) - [c39]Ellie Beauprez, Anne-Cécile Caron, Maxime Morge, Jean-Christophe Routier:
Échange de tâches pour la réduction de la durée moyenne de réalisation. JFSMA 2022: 19-28 - 2021
- [j8]Quentin Baert, Anne-Cécile Caron, Maxime Morge, Jean-Christophe Routier, Kostas Stathis:
An adaptive multi-agent system for task reallocation in a MapReduce job. J. Parallel Distributed Comput. 153: 75-88 (2021) - [c38]Ellie Beauprez, Anne-Cécile Caron, Maxime Morge, Jean-Christophe Routier:
Task Bundle Delegation for Reducing the Flowtime. ICAART (Revised Selected Papers) 2021: 22-45 - [c37]Ellie Beauprez, Anne-Cécile Caron, Maxime Morge, Jean-Christophe Routier:
A Multi-Agent Negotiation Strategy for Reducing the Flowtime. ICAART (1) 2021: 58-68 - [c36]Ellie Beauprez, Anne-Cécile Caron, Maxime Morge, Jean-Christophe Routier:
Une stratégie de négociation multi-agents pour réduire la durée moyenne de réalisation. JFSMA 2021: 31-40 - [c35]Ellie Beauprez, Luc Bigand, Anne-Cécile Caron, Maxime Morge, Jean-Christophe Routier:
Réaffectation de tâches de la théorie à la pratique : état de l'art et retour d'expérience. JFSMA 2021: 51-60
2010 – 2019
- 2019
- [c34]Quentin Baert, Anne-Cécile Caron, Maxime Morge, Jean-Christophe Routier, Kostas Stathis:
Adaptive Multi-agent System for Situated Task Allocation. AAMAS 2019: 1790-1792 - [c33]Quentin Baert, Anne-Cécile Caron, Maxime Morge, Jean-Christophe Routier, Kostas Stathis:
A Location-Aware Strategy for Agents Negotiating Load-Balancing. ICTAI 2019: 668-675 - [c32]Quentin Baert, Anne-Cécile Caron, Maxime Morge, Jean-Christophe Routier, Kostas Stathis:
Stratégie situationnelle pour l'équilibrage de charge. JFSMA 2019: 9-18 - 2018
- [j7]Quentin Baert, Anne-Cécile Caron, Maxime Morge, Jean-Christophe Routier:
Fair multi-agent task allocation for large datasets analysis. Knowl. Inf. Syst. 54(3): 591-615 (2018) - 2017
- [j6]Quentin Baert, Anne-Cécile Caron, Maxime Morge, Jean-Christophe Routier:
Allocation équitable de tâches pour l'analyse de données massives. Rev. d'Intelligence Artif. 31(4): 401-426 (2017) - [c31]Quentin Baert, Anne-Cécile Caron, Maxime Morge, Jean-Christophe Routier:
Negotiation Strategy of Divisible Tasks for Large Dataset Processing. EUMAS/AT 2017: 370-384 - [c30]Quentin Baert, Anne-Cécile Caron, Maxime Morge, Jean-Christophe Routier:
Stratégie de découpe de tâche pour le traitement de données massives. JFSMA 2017: 65-74 - 2016
- [j5]Fabien Delecroix, Maxime Morge, Thomas Nachtergaelle, Jean-Christophe Routier:
Multi-party negotiation with preferences rather than utilities. Multiagent Grid Syst. 12(2): 139-165 (2016) - [c29]Quentin Baert, Anne-Cécile Caron, Maxime Morge, Jean-Christophe Routier:
Allocation équitable de tâches pour l'analyse de données massives. JFSMA 2016: 55-64 - [c28]Quentin Baert, Anne-Cécile Caron, Maxime Morge, Jean-Christophe Routier:
Fair Multi-agent Task Allocation for Large Data Sets Analysis. PAAMS 2016: 24-35 - 2014
- [j4]Fabien Delecroix, Maxime Morge, Jean-Christophe Routier:
Réduire l'arbitraire par la négociation quitte à concéder. Rev. d'Intelligence Artif. 28(4): 433-462 (2014) - [c27]Fabien Delecroix, Maxime Morge, Jean-Christophe Routier:
Bilateral Negotiation of a Meeting Point in a Maze. PAAMS 2014: 86-97 - [c26]Fabien Delecroix, Maxime Morge, Jean-Christophe Routier:
Bilateral Negotiation of a Meeting Point in a Maze: Demonstration. PAAMS 2014: 327-330 - 2013
- [c25]Fabien Delecroix, Maxime Morge, Jean-Christophe Routier:
Négociation bilatérale pour la recherche d'un compromis. JFSMA 2013: 19-28 - 2012
- [c24]Fabien Delecroix, Maxime Morge, Jean-Christophe Routier:
A Virtual Selling Agent Which Is Proactive and Adaptive. PAAMS 2012: 57-66 - [c23]Fabien Delecroix, Maxime Morge, Jean-Christophe Routier:
A Virtual Selling Agent Which Is Proactive and Adaptive: Demonstration. PAAMS 2012: 233-236 - 2011
- [c22]Tony Dujardin, José Rouillard, Jean-Christophe Routier, Jean-Claude Tarby:
Gestion intelligente d'un contexte domotique par un SMA (présentation courte). JFSMA 2011: 137-146 - [c21]Fabien Delecroix, Maxime Morge, Jean-Christophe Routier:
Vers un agent dialogique proactif (présentation courte). JFSMA 2011: 191-200 - 2010
- [c20]Tony Dujardin, Jean-Christophe Routier:
A Motivation-Based Mechanism to Design Behaviors. ECAI 2010: 1067-1068 - [c19]Tony Dujardin, Jean-Christophe Routier:
Behavior Design of Game Character's Agent. IAT 2010: 423-430
2000 – 2009
- 2009
- [j3]Tony Dujardin, Jean-Christophe Routier:
Définir des individualités pour des personnages non joueurs. Rev. d'Intelligence Artif. 23(2-3): 253-292 (2009) - [c18]Tony Dujardin, Jean-Christophe Routier:
How to Easily Design Reusable Behaviours for Situated Characters?. ICAART 2009: 167-172 - 2007
- [j2]Maxime Morge, Jean-Christophe Routier:
Debating over heterogeneous descriptions. Appl. Ontology 2(3-4): 333-349 (2007) - 2006
- [c17]Maxime Morge, Jean-Christophe Routier, Yann Secq, Tony Dujardin:
Comment atteindre un accord sur une représentation ? JFSMA 2006: 167-170 - 2005
- [c16]Damien Devigne, Philippe Mathieu, Jean-Christophe Routier:
Team of cognitive agents with a leader: how to let them acquire autonomy. CIG 2005 - [c15]Damien Devigne, Philippe Mathieu, Jean-Christophe Routier:
Gestion d'équipes et autonomie des agents (article court). JFSMA 2005: 47-50 - 2004
- [c14]Damien Devigne, Philippe Mathieu, Jean-Christophe Routier:
Planning for Spatially Situated Agents. IAT 2004: 385-388 - 2003
- [c13]Philippe Mathieu, Jean-Christophe Routier, Yann Secq:
RIO: Roles, Interactions and Organizations. CEEMAS 2003: 147-157 - [c12]Philippe Mathieu, Jean-Christophe Routier, Yann Secq:
Bridging the Gap Between Semantic and Pragmatic. IKE 2003: 308-314 - [c11]Philippe Mathieu, Jean-Christophe Routier, Yann Secq:
Runnable Specifications of Interactions for Open Multi-Agent Systems. IKE 2003: 431-437 - [c10]Philippe Mathieu, Jean-Christophe Routier, Yann Secq:
Towards a Pragmatic Methodology for Open Multi-agent Systems. ISMIS 2003: 206-210 - [c9]Philippe Mathieu, Jean-Christophe Routier, Yann Secq:
Towards a Pragmatic Use of Ontologies in Multi-agent Platforms. KES 2003: 1395-1402 - 2002
- [c8]Philippe Mathieu, Jean-Christophe Routier, Yann Secq:
Dynamic organization of multi-agent systems. AAMAS 2002: 451-452 - [c7]Jean-Christophe Routier, Philippe Mathieu:
A Multi-Agent Approach to Cooperative Work. CADUI 2002: 367-380 - [c6]Philippe Mathieu, Jean-Christophe Routier, Yann Secq:
Principles for Dynamic Multi-agent Organizations. PRIMA 2002: 109-122
1990 – 1999
- 1996
- [j1]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
- [c5]Philippe Devienne, Patrick Lebègue, Jean-Christophe Routier, Jörg Würtz:
One Binary Horn Clause is Enough. STACS 1994: 21-32 - 1993
- [c4]Philippe Devienne, Patrick Lebègue, Jean-Christophe Routier:
The Emptiness Problem of One Binary Recursive Horn Clause is Undecidable. ILPS 1993: 250-265 - [c3]Philippe Devienne, Patrick Lebègue, Jean-Christophe Routier:
Halting Problem of One Binary Horn Clause is Undecidable. STACS 1993: 48-57 - 1992
- [c2]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 - [c1]Philippe Devienne, Patrick Lebègue, Jean-Christophe Routier:
Weighted Systems Revisited. WSA 1992: 163-173
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-07-19 19:14 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:
