Exploració per tema "dynamic programming"
Ara es mostren els items 2-5 de 5
-
Dynamic programming for graphs on surfaces
(2014-02-01)
Article
Accés obertWe provide a framework for the design and analysis of dynamic programming algorithms for surface-embedded graphs on n vertices and branchwidth at most k. Our technique applies to general families of problems where standard ... -
Evaluation of optimization techniques for aggregation
(Universitat Politècnica de Catalunya, 2017-01-15)
Projecte Final de Màster Oficial
Accés obert
Realitzat a/amb: Technische Universität MünchenAggregations are almost always done at the top of operator tree after all selections and joins in a SQL query. But actually they can be done before joins and make later joins much cheaper when used properly. Although ... -
On the comparison of predictive control and command governor approaches for operational management of drinking water networks: a case study
(2014)
Text en actes de congrés
Accés obertThis paper evaluates the application of command governor (CG) strategy for the operational control of drinking water networks (DWN) given their large-scale and complex nature, the permanent and relevant effect of the ... -
Variants of plane diameter completion
(2015-11-19)
Article
Accés obertThe Plane Diameter Completion problem asks, given a plane graph G and a positive integer d, if it is a spanning subgraph of a plane graph H that has diameter at most d. We examine two variants of this problem where the ...