Vincent Roger

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
The frameworks dedicated to the representation of quantitative temporal constraint satisfaction problems, as rich as they are in terms of expressiveness, define difficult requests - typically NP-complete decision problems. It is therefore adventurous to use them for an online resolution. Hence the idea to compile the original problem into a form that could(More)
  • 1