Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Anne-Cécile Caron

dblp:c/ACCaron · DBLP profile ↗
← Back
14ranked-venue papers
4as first author
2since 2021 · last 2021
0000-0001-6672-5686ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 9 · 4 first-authorArtificial intelligence and machine learning · 2 · 1 since 2021Databases, data management, data science and information retrieval · 2Systems, architecture and hardware · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Databases, data mining, and information retrieval
1 paper
Database theory · 50% Query processing and optimization · 50%
Software engineering, system software, and programming languages
1 paper
Program analysis · 100%
Theoretical computer science
1 paper
Automated reasoning and model checking · 50% Automata and formal languages · 50%

Topics — the 4 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Query processing and optimization
query rewriting
0.212014
Static analysis of XML security views and query rewriting · Inf. Comput. 2014
Program analysis
static analysis
0.112014
Static analysis of XML security views and query rewriting · Inf. Comput. 2014
Automated reasoning and model checking
constraint solving
0.011994
Pumping, Cleaning and Symbolic Constraints Solving · ICALP 1994
Automata and formal languages › regular languages
pumping lemma
0.011994
Pumping, Cleaning and Symbolic Constraints Solving · ICALP 1994
YearPublicationVenuePosition
2021 A Multi-Agent Negotiation Strategy for Reducing the Flowtime
abstract
2021
Ellie Beauprez, Anne-Cécile Caron, Maxime Morge, Jean-Christophe Routier
ICAART (1)2
2021 An adaptive multi-agent system for task reallocation in a MapReduce job
Quentin Baert, Anne-Cécile Caron, Maxime Morge, Jean-Christophe Routier, Kostas Stathis
J. Parallel Distributed Comput.2
2019 A Location-Aware Strategy for Agents Negotiating Load-Balancing
abstract
We study a novel location-aware strategy for distributed systems where cooperating agents perform the load-balancing. The strategy allows agents to identify opportunities within a current unbalanced allocation, which in turn triggers concurrent and one-to-many negotiations amongst agents to locally reallocate some tasks. The tasks are reallocated according to the proximity of the resources and they are performed in accordance with the capabilities of the nodes in which agents are situated. This dynamic and on-going negotiation process takes place concurrently with the task execution and so the task allocation process is adaptive to disruptions (task consumption, slowing down nodes). We evaluate the strategy in a multi-agent deployment of the MapReduce design pattern for processing large datasets. Empirical results demonstrate that our strategy significantly improves the overall runtime of the data processing.
Quentin Baert, Anne-Cécile Caron, Maxime Morge, Jean-Christophe Routier, Kostas Stathis
ICTAI2
2018 Fair multi-agent task allocation for large datasets analysis
Quentin Baert, Anne-Cécile Caron, Maxime Morge, Jean-Christophe Routier
Knowl. Inf. Syst.2
2014 Static analysis of XML security views and query rewriting
Benoît Groz, Slawomir Staworko, Anne-Cécile Caron, Yves Roos, Sophie Tison
Inf. Comput.3
2011 View update translation for XML
abstract
We study the problem of update translation for views on XML documents. More precisely, given an XML view definition and a user defined view update program, find a source update program that translates the view update without side effects on the view. Additionally, we require the translation to be defined on all possible source documents; this corresponds to Hegner's notion of uniform translation. The existence of such translation would allow to update XML views without the need of materialization.
Iovka Boneva, Anne-Cécile Caron, Benoît Groz, Yves Roos, Sophie Tison, Slawomir Staworko
ICDT2
2007 Path constraints in semistructured data
Yves Andre, Anne-Cécile Caron, Denis Debarbieux, Yves Roos, Sophie Tison
Theor. Comput. Sci.2
2004 Extraction and Implication of Path Constraints
Yves Andre, Anne-Cécile Caron, Denis Debarbieux, Yves Roos, Sophie Tison
MFCS2
1999 On decidability of boundedness property for regular path queries
abstract
International audience
Yves Andre, Francis Bossut, Anne-Cécile Caron
Developments in Language Theory3
1999 Deciding the Satisfiability of Quantifier free Formulae on One-Step Rewriting
Anne-Cécile Caron, Franck Seynhaeve, Sophie Tison, Marc Tommasi
RTA1
1995 Automata for Reduction Properties Solving
Max Dauchet, Anne-Cécile Caron, Jean-Luc Coquidé
J. Symb. Comput.2
1994 Pumping, Cleaning and Symbolic Constraints Solving
Anne-Cécile Caron, Hubert Comon-Lundh, Jean-Luc Coquidé, Max Dauchet, Florent Jacquemard
ICALP1
1994 Decidability of Reachability for Disjoint Union of Term Rewriting Systems
Anne-Cécile Caron, Jean-Luc Coquidé
Theor. Comput. Sci.1
1993 Encompassment Properties and Automata with Constraints
Anne-Cécile Caron, Jean-Luc Coquidé, Max Dauchet
RTA1