- From: Karl Dubost <karl@w3.org>
- Date: Wed, 24 Aug 2005 23:19:48 -0400
- To: semantic-web@w3.org
Hi,
I'm preparing my program for the world film festival. My main tool is
a loosy catalogue where I report movies and time in a calendar and
then by hand I will select my movies depending on the conflicts and
my constraints.
Here my questions, because it's a fairly common problem with many
possible applications.
Consider a series of events: En, n is an integer
En has a title
has a start time
has a duration
has a date
(has a category)
has a location
A "title" has 1 to 4 En (Basically the same movie can be played at
different times during a week).
So from a selection of certain number of titles, I want to have a
schedule which optimize my viewing, basically to remove conflicts.
It's a fairly common problem, because it's the case of
- any festival of any kinds with multiple events at the same time
- class schedule in a school
- business meetings with many people
that will be a selling case for the semantic Web definitely. It could
be combined with external resources, etc.
* algorithm
To help the thinking process and the way I do to select manually
1. Choose all the movies I'm interested by
2. Put them in a calendar, conflict or not.
3. Take the first day and select the movies I want to see
4. Remove the selected one from the rest of the calendar,
- except if on a day later the movie has no conflicts,
in that case select, another movie from the first day.
5. Going to the next day and repeat the process.
Usually it minimizes the conflicts and go quite fast.
--
Karl Dubost - http://www.w3.org/People/karl/
W3C Conformance Manager
*** Be Strict To Be Cool ***
Received on Thursday, 25 August 2005 03:20:17 UTC