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

Philippe Chassaing

dblp:13/189 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 2004
—ORCID · none

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

Artificial intelligence and machine learning · 1Databases, data management, data science and information retrieval · 1Graphics, computer vision, multimedia, augmented reality and games · 1Theory of computation · 1

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.

Artificial intelligence
1 paper
Planning, search and constraint satisfaction · 100%

Topics — the 1 heaviest of 2, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Knowledge, reasoning and agents › Planning, search and constraint satisfaction
anytime algorithm
0.011999
Real-Time Problem-Solving with Contract Algorithms · IJCAI 1999

Methods — techniques the papers use, named apart from their topics

contract algorithms · 0.0
YearPublicationVenuePosition
2004 The worst-case chip problem
Laurent Alonso, Philippe Chassaing, Edward M. Reingold, René Schott
Inf. Process. Lett.2
1999 Real-Time Problem-Solving with Contract Algorithms
Shlomo Zilberstein, François Charpillet, Philippe Chassaing
IJCAI3