Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Interval_scheduling> ?p ?o }
Showing triples 1 to 25 of
25
with 100 triples per page.
- Interval_scheduling abstract "Interval scheduling is a class of problems in computer science, particularly in the area of algorithm design. The problems consider a set of tasks. Each task is represented by an interval describing the time in which it needs to be executed. For instance, task A might run from 2:00 to 5:00, task B might run from 4:00 to 10:00 and task C might run from 9:00 to 11:00. A subset of intervals is compatible if no two intervals overlap. For example, the subset {A,C} is compatible, as well as {B}, but {A,B} is not compatible and so is {B,C}.The interval scheduling maximization problem (ISMP) is to find a largest compatible set - a set of non-overlapping intervals of maximum size. The goal here is to execute as many tasks as possible.In an upgraded version of the problem, the intervals are partitioned into groups. A subset of intervals is compatible if no two intervals overlap, and moreover, no two intervals belong to the same group (i.e. the subset contains at most a single representative interval of each group).The group interval scheduling decision problem (GISDP) is to decide whether there exists a compatible set in which all groups are represented. The goal here is to execute a single representative task from each group. GISDPk is a restricted version of GISDP in which the number of intervals in each group is at most k.The group interval scheduling maximization problem (GISMP) is to find a largest compatible set - a set of non-overlapping representatives of maximum size. The goal here is to execute a representative task from as many groups as possible. GISMPk is a restricted version of GISMP in which the number of intervals in each group is at most k. This problem is often called JISPk, where J stands for Job.GISMP is the most general problem; the other two problems can be seen as special cases of it: ISMP is the special case in which each task belongs to its own group (i.e. it is equal to GISMP1). GISDP is the problem of deciding whether the maximum is exactly equal to the number of groups.".
- Interval_scheduling thumbnail IntervalSelection.svg?width=300.
- Interval_scheduling wikiPageID "7570573".
- Interval_scheduling wikiPageRevisionID "602264591".
- Interval_scheduling hasPhotoCollection Interval_scheduling.
- Interval_scheduling subject Category:Scheduling_algorithms.
- Interval_scheduling type Abstraction100002137.
- Interval_scheduling type Act100030358.
- Interval_scheduling type Activity100407535.
- Interval_scheduling type Algorithm105847438.
- Interval_scheduling type Event100029378.
- Interval_scheduling type Procedure101023820.
- Interval_scheduling type PsychologicalFeature100023100.
- Interval_scheduling type Rule105846932.
- Interval_scheduling type SchedulingAlgorithms.
- Interval_scheduling type YagoPermanentlyLocatedEntity.
- Interval_scheduling comment "Interval scheduling is a class of problems in computer science, particularly in the area of algorithm design. The problems consider a set of tasks. Each task is represented by an interval describing the time in which it needs to be executed. For instance, task A might run from 2:00 to 5:00, task B might run from 4:00 to 10:00 and task C might run from 9:00 to 11:00. A subset of intervals is compatible if no two intervals overlap.".
- Interval_scheduling label "Interval scheduling".
- Interval_scheduling sameAs m.0265mbd.
- Interval_scheduling sameAs Q17092629.
- Interval_scheduling sameAs Q17092629.
- Interval_scheduling sameAs Interval_scheduling.
- Interval_scheduling wasDerivedFrom Interval_scheduling?oldid=602264591.
- Interval_scheduling depiction IntervalSelection.svg.
- Interval_scheduling isPrimaryTopicOf Interval_scheduling.
