Matches in SemOpenAlex for { <https://semopenalex.org/work/W2000399740> ?p ?o ?g. }
Showing items 1 to 88 of
88
with 100 items per page.
- W2000399740 endingPage "96" @default.
- W2000399740 startingPage "80" @default.
- W2000399740 abstract "Many optimization problems can be naturally represented as (hyper) graphs, where vertices correspond to variables and edges to tasks, whose cost depends on the values of the adjacent variables. Capitalizing on the structure of the graph, suitable dynamic programming strategies can select certain orders of evaluation of the variables which guarantee to reach both an optimal solution and a minimal size of the tables computed in the optimization process. In this paper we introduce a simple algebraic specification with parallel composition and restriction whose terms up to structural axioms are the graphs mentioned above. In addition, free (unrestricted) vertices are labelled with variables, and the specification includes operations of name permutation with finite support. We show a correspondence between the well-known tree decompositions of graphs and our terms. If an axiom of scope extension is dropped, several (hierarchical) terms actually correspond to the same graph. A suitable graphical structure can be found, corresponding to every hierarchical term. Evaluating such a graphical structure in some target algebra yields a dynamic programming strategy. If the target algebra satisfies the scope extension axiom, then the result does not depend on the particular structure, but only on the original graph. We apply our approach to the parking optimization problem developed in the ASCENS e-mobility case study, in collaboration with Volkswagen. Dynamic programming evaluations are particularly interesting for autonomic systems, where actual behavior often consists of propagating local knowledge to obtain global knowledge and getting it back for local decisions." @default.
- W2000399740 created "2016-06-24" @default.
- W2000399740 creator A5021533181 @default.
- W2000399740 creator A5061468940 @default.
- W2000399740 creator A5076561308 @default.
- W2000399740 date "2015-04-10" @default.
- W2000399740 modified "2023-09-29" @default.
- W2000399740 title "Dynamic Programming on Nominal Graphs" @default.
- W2000399740 cites W1553130492 @default.
- W2000399740 cites W1573313194 @default.
- W2000399740 cites W1976011706 @default.
- W2000399740 cites W1982333717 @default.
- W2000399740 cites W1989969984 @default.
- W2000399740 cites W1990563881 @default.
- W2000399740 cites W2000131343 @default.
- W2000399740 cites W2002722727 @default.
- W2000399740 cites W2005863443 @default.
- W2000399740 cites W2013967419 @default.
- W2000399740 cites W2021180976 @default.
- W2000399740 cites W2027566319 @default.
- W2000399740 cites W2055916047 @default.
- W2000399740 cites W2060933875 @default.
- W2000399740 cites W2076340107 @default.
- W2000399740 cites W2093837537 @default.
- W2000399740 cites W2139148957 @default.
- W2000399740 cites W2156525231 @default.
- W2000399740 cites W3122941067 @default.
- W2000399740 cites W4213368513 @default.
- W2000399740 cites W4238922187 @default.
- W2000399740 cites W4245071229 @default.
- W2000399740 doi "https://doi.org/10.4204/eptcs.181.6" @default.
- W2000399740 hasPublicationYear "2015" @default.
- W2000399740 type Work @default.
- W2000399740 sameAs 2000399740 @default.
- W2000399740 citedByCount "2" @default.
- W2000399740 countsByYear W20003997402018 @default.
- W2000399740 countsByYear W20003997402020 @default.
- W2000399740 crossrefType "journal-article" @default.
- W2000399740 hasAuthorship W2000399740A5021533181 @default.
- W2000399740 hasAuthorship W2000399740A5061468940 @default.
- W2000399740 hasAuthorship W2000399740A5076561308 @default.
- W2000399740 hasBestOaLocation W20003997401 @default.
- W2000399740 hasConcept C126255220 @default.
- W2000399740 hasConcept C132525143 @default.
- W2000399740 hasConcept C134306372 @default.
- W2000399740 hasConcept C167729594 @default.
- W2000399740 hasConcept C18912844 @default.
- W2000399740 hasConcept C2524010 @default.
- W2000399740 hasConcept C33923547 @default.
- W2000399740 hasConcept C37404715 @default.
- W2000399740 hasConcept C41008148 @default.
- W2000399740 hasConcept C80444323 @default.
- W2000399740 hasConcept C9376300 @default.
- W2000399740 hasConceptScore W2000399740C126255220 @default.
- W2000399740 hasConceptScore W2000399740C132525143 @default.
- W2000399740 hasConceptScore W2000399740C134306372 @default.
- W2000399740 hasConceptScore W2000399740C167729594 @default.
- W2000399740 hasConceptScore W2000399740C18912844 @default.
- W2000399740 hasConceptScore W2000399740C2524010 @default.
- W2000399740 hasConceptScore W2000399740C33923547 @default.
- W2000399740 hasConceptScore W2000399740C37404715 @default.
- W2000399740 hasConceptScore W2000399740C41008148 @default.
- W2000399740 hasConceptScore W2000399740C80444323 @default.
- W2000399740 hasConceptScore W2000399740C9376300 @default.
- W2000399740 hasLocation W20003997401 @default.
- W2000399740 hasLocation W20003997402 @default.
- W2000399740 hasLocation W20003997403 @default.
- W2000399740 hasLocation W20003997404 @default.
- W2000399740 hasLocation W20003997405 @default.
- W2000399740 hasOpenAccess W2000399740 @default.
- W2000399740 hasPrimaryLocation W20003997401 @default.
- W2000399740 hasRelatedWork W1633014964 @default.
- W2000399740 hasRelatedWork W2018671907 @default.
- W2000399740 hasRelatedWork W2019790099 @default.
- W2000399740 hasRelatedWork W2047742505 @default.
- W2000399740 hasRelatedWork W2061175295 @default.
- W2000399740 hasRelatedWork W2111362432 @default.
- W2000399740 hasRelatedWork W284626623 @default.
- W2000399740 hasRelatedWork W3035881305 @default.
- W2000399740 hasRelatedWork W3166140166 @default.
- W2000399740 hasRelatedWork W3176049953 @default.
- W2000399740 hasVolume "181" @default.
- W2000399740 isParatext "false" @default.
- W2000399740 isRetracted "false" @default.
- W2000399740 magId "2000399740" @default.
- W2000399740 workType "article" @default.