Comparison of CP and IP Techniques for Data Transfer Planning
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F10%3A00045275" target="_blank" >RIV/00216224:14330/10:00045275 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Comparison of CP and IP Techniques for Data Transfer Planning
Original language description
Planning of data transfers becomes an interesting problem when bandwidth of a requested traffic is comparable to a capacity of available networks. This type of problem is solved within CoUniverse framework supporting interactive high-quality media distribution for collaborative environments.The CoUniverse contains two alternative planning modules which comparison is the subject of this work. While a constraint programming solver was improved over the years, a new integer programming solver has been introduced recently. Current intent is a parallel development of both solvers and their improvement based on experiences with both methodologies.
Czech name
—
Czech description
—
Classification
Type
O - Miscellaneous
CEP classification
IN - Informatics
OECD FORD branch
—
Result continuities
Project
—
Continuities
Z - Vyzkumny zamer (s odkazem do CEZ)<br>S - Specificky vyzkum na vysokych skolach
Others
Publication year
2010
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů