This HTML5 document contains 44 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
n9http://linked.opendata.cz/ontology/domain/vavai/riv/typAkce/
dctermshttp://purl.org/dc/terms/
n13http://purl.org/net/nknouf/ns/bibtex#
n12http://localhost/temp/predkladatel/
n19http://linked.opendata.cz/resource/domain/vavai/projekt/
n11http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n20http://linked.opendata.cz/ontology/domain/vavai/
n16http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F00216224%3A14330%2F03%3A00008701%21RIV%2F2004%2FGA0%2F143304%2FN/
shttp://schema.org/
skoshttp://www.w3.org/2004/02/skos/core#
n3http://linked.opendata.cz/ontology/domain/vavai/riv/
n2http://linked.opendata.cz/resource/domain/vavai/vysledek/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n6http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n4http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n18http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n10http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n17http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n14http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n7http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F00216224%3A14330%2F03%3A00008701%21RIV%2F2004%2FGA0%2F143304%2FN
rdf:type
skos:Concept n20:Vysledek
dcterms:description
Solving real-life planning, scheduling, and timetabling problems is usually an iterative process in which, after seeing the generated solution, users may change the problem constraints. This change requires producing a new solution which satisfies these constraints but not being too far from the original solution. This type of problem is called a minimal perturbation problem. The paper formally describes a minimal perturbation problem in the context of constraint satisfaction and it proposes a new depth-first search algorithm for solving a particular instance of the minimal perturbation problem. Solving real-life planning, scheduling, and timetabling problems is usually an iterative process in which, after seeing the generated solution, users may change the problem constraints. This change requires producing a new solution which satisfies these constraints but not being too far from the original solution. This type of problem is called a minimal perturbation problem. The paper formally describes a minimal perturbation problem in the context of constraint satisfaction and it proposes a new depth-first search algorithm for solving a particular instance of the minimal perturbation problem.
dcterms:title
A New Labeling Algorithm to Solve Minimal Perturbation Problems: A Preliminary Report A New Labeling Algorithm to Solve Minimal Perturbation Problems: A Preliminary Report
skos:prefLabel
A New Labeling Algorithm to Solve Minimal Perturbation Problems: A Preliminary Report A New Labeling Algorithm to Solve Minimal Perturbation Problems: A Preliminary Report
skos:notation
RIV/00216224:14330/03:00008701!RIV/2004/GA0/143304/N
n3:strany
1
n3:aktivita
n18:P
n3:aktivity
P(GA201/01/0942)
n3:dodaniDat
n7:2004
n3:domaciTvurceVysledku
n11:8739781
n3:druhVysledku
n14:D
n3:duvernostUdaju
n4:S
n3:entitaPredkladatele
n16:predkladatel
n3:idSjednocenehoVysledku
596987
n3:idVysledku
RIV/00216224:14330/03:00008701
n3:jazykVysledku
n10:eng
n3:klicovaSlova
constraint satisfaction; solution update; search
n3:klicoveSlovo
n6:solution%20update n6:search n6:constraint%20satisfaction
n3:kontrolniKodProRIV
[756B9552C41D]
n3:mistoKonaniAkce
Glasgow (United Kingdom)
n3:mistoVydani
Glasgow (United Kingdom)
n3:nazevZdroje
Proceedings of the 22nd Workshop of the UK Planning and Scheduling Special Interest Group (PlanSIG)
n3:obor
n17:IN
n3:pocetDomacichTvurcuVysledku
1
n3:pocetTvurcuVysledku
3
n3:pocetUcastnikuAkce
0
n3:pocetZahranicnichUcastnikuAkce
0
n3:projekt
n19:GA201%2F01%2F0942
n3:rokUplatneniVysledku
n7:2003
n3:tvurceVysledku
Rudová, Hana Barták, Roman Müller, Tomáš
n3:typAkce
n9:WRD
n3:zahajeniAkce
2003-12-09+01:00
s:issn
1368-5708
s:numberOfPages
11
n13:hasPublisher
University of Strathclyde
n12:organizacniJednotka
14330