Anne-Cécile Caron

Orcid: 0000-0001-6672-5686

Affiliations:
  • LIFL Lille, France


According to our database1, Anne-Cécile Caron authored at least 34 papers between 1991 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Délégation de lots de tâches pour la réduction de la durée moyenne de réalisation.
Revue Ouverte d'Intelligence Artificielle (ROIA), 2023

Adaptive Consumption by Continuous Negotiation.
Proceedings of the Advances in Practical Applications of Agents, Multi-Agent Systems, and Cognitive Mimetics. The PAAMS Collection, 2023

Consommation adaptative par négociation continue.
Proceedings of the Explicabilité des systèmes multi-agents, 2023

2022
Un système multi-agent adaptatif pour la réallocation de tâches au sein d'un job MapReduce.
ROIA, 2022

Échange de tâches pour la réduction de la durée moyenne de réalisation.
Proceedings of the SMA et Smart Cities, 2022

2021
An adaptive multi-agent system for task reallocation in a MapReduce job.
J. Parallel Distributed Comput., 2021

Une stratégie de négociation multi-agents pour réduire la durée moyenne de réalisation.
Proceedings of the Collectifs cyber-physiques, 2021

Réaffectation de tâches de la théorie à la pratique : état de l'art et retour d'expérience.
Proceedings of the Collectifs cyber-physiques, 2021

Task Bundle Delegation for Reducing the Flowtime.
Proceedings of the Agents and Artificial Intelligence - 13th International Conference, 2021

A Multi-Agent Negotiation Strategy for Reducing the Flowtime.
Proceedings of the 13th International Conference on Agents and Artificial Intelligence, 2021

2019
Stratégie situationnelle pour l'équilibrage de charge.
Proceedings of the Systèmes Multi-Agents et simulation, 2019

A Location-Aware Strategy for Agents Negotiating Load-Balancing.
Proceedings of the 31st IEEE International Conference on Tools with Artificial Intelligence, 2019

Adaptive Multi-agent System for Situated Task Allocation.
Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems, 2019

2018
Fair multi-agent task allocation for large datasets analysis.
Knowl. Inf. Syst., 2018

2017
Allocation équitable de tâches pour l'analyse de données massives.
Rev. d'Intelligence Artif., 2017

Stratégie de découpe de tâche pour le traitement de données massives.
Proceedings of the Cohésion : fondement ou propriété émergente - JFSMA 17, 2017

Negotiation Strategy of Divisible Tasks for Large Dataset Processing.
Proceedings of the Multi-Agent Systems and Agreement Technologies, 2017

2016
Fair Multi-agent Task Allocation for Large Data Sets Analysis.
Proceedings of the Advances in Practical Applications of Scalable Multi-agent Systems. The PAAMS Collection, 2016

2014
Static analysis of XML security views and query rewriting.
Inf. Comput., 2014

2011
View update translation for XML.
Proceedings of the Database Theory, 2011

2009
XML Security Views Revisited.
Proceedings of the Database Programming Languages, 2009

2008
Complexity of Earliest Query Answering with Streaming Tree Automata.
Proceedings of the PLAN-X 2008, 2008

2007
Path constraints in semistructured data.
Theor. Comput. Sci., 2007

2005
Indexes and Path Constraints in Semistructured Data.
Proceedings of the 16th International Workshop on Database and Expert Systems Applications (DEXA 2005), 2005

2004
Extraction and Implication of Path Constraints.
Proceedings of the Mathematical Foundations of Computer Science 2004, 2004

2003
Modèles de données semi-structurées et contraintes d'inclusion.
Proceedings of the Extraction et gestion des connaissances (EGC'2003), 2003

1999
Deciding the Satisfiability of Quantifier free Formulae on One-Step Rewriting.
Proceedings of the Rewriting Techniques and Applications, 10th International Conference, 1999

On decidability of boundedness property for regular path queries.
Proceedings of the Developments in Language Theory, 1999

1995
Automata for Reduction Properties Solving.
J. Symb. Comput., 1995

1994
Decidability of Reachability for Disjoint Union of Term Rewriting Systems.
Theor. Comput. Sci., 1994

Pumping, Cleaning and Symbolic Constraints Solving.
Proceedings of the Automata, Languages and Programming, 21st International Colloquium, 1994

1993
Encompassment Properties and Automata with Constraints.
Proceedings of the Rewriting Techniques and Applications, 5th International Conference, 1993

1992
Decidability of Reachability and Disjoint Union of Term Rewriting Systems.
Proceedings of the CAAP '92, 1992

1991
Linear Bounded Automata and Rewrite Systems: Influence of Initial Configurations on Decision Properties.
Proceedings of the TAPSOFT'91: Proceedings of the International Joint Conference on Theory and Practice of Software Development, 1991


  Loading...