About: Discovering Equivalence Classes in Precedence Graphs

Facets (new session)
Description
Metadata
Settings
- owl:sameAs
- Inference Rule:

About: Discovering Equivalence Classes in Precedence Graphs Goto Sponge NotDistinct Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

Attributes	Values
rdf:type	skos:Concept http://linked.opendata.cz/ontology/domain/vavai/Vysledek
Description	Článek ukazuje, že identifikovat ekvivalentní uzly v precedenčních sítí s alternativami je NP těžký problém a popisuje heuristický algoritmus pro hledání ekvivalencí. (cs) Knowledge is a specific type of information that can improve the efficiency of problem solving. During automated problem solving it may happen that knowl-edge that is known at the user level is lost in formalization. Hence, it seems useful to re-discover this knowledge to improve the efficiency of problem solving. This paper describes a method for identifying equivalent nodes in the precedence graph with alternative branches. Such graphs are useful for modeling manufacturing (and other) processes. Unfortunately, the formal model (which uses the precedence graph with alternatives) loses information about logical dependencies between some nodes while this information can be useful for efficient problem solving. The paper shows that identifying equivalent nodes is an NP-hard problem. It also presents an algorithm that can discover some equivalence groups that appear frequently in real-life problems. Knowledge is a specific type of information that can improve the efficiency of problem solving. During automated problem solving it may happen that knowl-edge that is known at the user level is lost in formalization. Hence, it seems useful to re-discover this knowledge to improve the efficiency of problem solving. This paper describes a method for identifying equivalent nodes in the precedence graph with alternative branches. Such graphs are useful for modeling manufacturing (and other) processes. Unfortunately, the formal model (which uses the precedence graph with alternatives) loses information about logical dependencies between some nodes while this information can be useful for efficient problem solving. The paper shows that identifying equivalent nodes is an NP-hard problem. It also presents an algorithm that can discover some equivalence groups that appear frequently in real-life problems. (en)
Title	Discovering Equivalence Classes in Precedence Graphs Hledání tříd ekvivalence v precedenčních grafech (cs) Discovering Equivalence Classes in Precedence Graphs (en)
skos:prefLabel	Discovering Equivalence Classes in Precedence Graphs Hledání tříd ekvivalence v precedenčních grafech (cs) Discovering Equivalence Classes in Precedence Graphs (en)
skos:notation	RIV/00216208:11320/07:00004951!RIV08-MSM-11320___
http://linked.open.../vavai/riv/strany	17;28
http://linked.open...avai/riv/aktivita	P Z
http://linked.open...avai/riv/aktivity	P(1M0545), P(GA201/07/0205), Z(MSM0021620838)
http://linked.open...vai/riv/dodaniDat	2008
http://linked.open...aciTvurceVysledku	Surynek, Pavel Čepek, Ondřej Barták, Roman
http://linked.open.../riv/druhVysledku	D - Článek ve sborníku
http://linked.open...iv/duvernostUdaju	S - Úplné a pravdivé údaje nepodléhající ochraně podle zvláštních právních předpisů
http://linked.open...titaPredkladatele	Univerzita Karlova v Praze / Matematicko-fyzikální fakulta
http://linked.open...dnocenehoVysledku	417481
http://linked.open...ai/riv/idVysledku	RIV/00216208:11320/07:00004951
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	Discovering; Equivalence; Classes; Precedence; Graphs (en)
http://linked.open.../riv/klicoveSlovo	Precedence Equivalence Discovering Classes Graphs
http://linked.open...ontrolniKodProRIV	[FE82B919837E]
http://linked.open...v/mistoKonaniAkce	Ostrava
http://linked.open...i/riv/mistoVydani	Ostrava
http://linked.open...i/riv/nazevZdroje	Znalosti 2007
http://linked.open...in/vavai/riv/obor	JC
http://linked.open...ichTvurcuVysledku	3 (xsd:int)
http://linked.open...cetTvurcuVysledku	3 (xsd:int)
http://linked.open...vavai/riv/projekt	Institute for Theoretical Computer Science Dynamic aspects of scheduling
http://linked.open...UplatneniVysledku	2007
http://linked.open...iv/tvurceVysledku	Barták, Roman Surynek, Pavel Čepek, Ondřej
http://linked.open...vavai/riv/typAkce	CST - Celostátní
http://linked.open.../riv/zahajeniAkce	2007-01-01 (xsd:date)
http://linked.open...n/vavai/riv/zamer	Moderní metody, struktury a systémy informatiky
number of pages	12 (xsd:int)
http://purl.org/ne...btex#hasPublisher	Vysoká škola báňská - Technická univerzita Ostrava
https://schema.org/isbn	978-80-248-1279-3
http://localhost/t...ganizacniJednotka	11320
is http://linked.open...avai/riv/vysledek of	Discovering Equivalence Classes in Precedence Graphs Discovering Equivalence Classes in Precedence Graphs Discovering Equivalence Classes in Precedence Graphs

Faceted Search & Find service v1.16.118 as of Jun 21 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 112 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software