Zobrazeno 1 - 3
of 3
pro vyhledávání: '"Irwin, Oliver"'
We present an elementary branch and bound algorithm with a simple analysis of why it achieves worstcase optimality for join queries on classes of databases defined respectively by cardinality or acyclic degree constraints. We then show that if one is
Externí odkaz:
http://arxiv.org/abs/2409.14094
Given a conjunctive query $Q$ and a database $D$, a direct access to the answers of $Q$ over $D$ is the operation of returning, given an index $k$, the $k$-th answer for some order on its answers. While this problem is #P-hard in general with respect
Externí odkaz:
http://arxiv.org/abs/2310.15800
Autor:
Dewar John, Irwin Oliver
This chapter considersthe identification, assessment, allocation, negotiation, and management of the risks associated with a particular project(such as delay risk, cost overruns, technology risk, off-take risk, revenue risk, operating risk, supply ri
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e042e98ff0937ff8c24d7b4dfccc7245
https://doi.org/10.1093/law/9780198715559.003.0005
https://doi.org/10.1093/law/9780198715559.003.0005