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

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

AttributesValues
rdf:type
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
http://linked.open...avai/riv/aktivity
  • P(1M0545), P(GA201/07/0205), Z(MSM0021620838)
http://linked.open...vai/riv/dodaniDat
http://linked.open...aciTvurceVysledku
http://linked.open.../riv/druhVysledku
http://linked.open...iv/duvernostUdaju
http://linked.open...titaPredkladatele
http://linked.open...dnocenehoVysledku
  • 417481
http://linked.open...ai/riv/idVysledku
  • RIV/00216208:11320/07:00004951
http://linked.open...riv/jazykVysledku
http://linked.open.../riv/klicovaSlova
  • Discovering; Equivalence; Classes; Precedence; Graphs (en)
http://linked.open.../riv/klicoveSlovo
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
http://linked.open...ichTvurcuVysledku
http://linked.open...cetTvurcuVysledku
http://linked.open...vavai/riv/projekt
http://linked.open...UplatneniVysledku
http://linked.open...iv/tvurceVysledku
  • Barták, Roman
  • Surynek, Pavel
  • Čepek, Ondřej
http://linked.open...vavai/riv/typAkce
http://linked.open.../riv/zahajeniAkce
http://linked.open...n/vavai/riv/zamer
number of pages
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
Faceted Search & Find service v1.16.118 as of Jun 21 2024


Alternative Linked Data Documents: ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
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