An Application of Constraint Programming to Mobile Data
| dc.contributor.author | BRESSAN, Stephane | en_US |
| dc.contributor.author | TOK, Wee Hyong | en_US |
| dc.contributor.author | PRESTWICH, Steven | en_US |
| dc.date.accessioned | 2005-11-10T07:32:18Z | en_US |
| dc.date.accessioned | 2017-01-23T07:00:01Z | |
| dc.date.available | 2005-11-10T07:32:18Z | en_US |
| dc.date.available | 2017-01-23T07:00:01Z | |
| dc.date.issued | 2005-10-19 | en_US |
| dc.description.abstract | Given the current ubiquity of wireless networks and mobile devices, data must be disseminated to a large number of these devices in an effective and efficient manner. A promising technique for such applications is data broadcasting. We introduce a new optimization problem derived from mobile data broadcasting applications. A single broadcaster transmits pages of data in sequence in response to requests from multiple clients, each asking for different subsets of a set of available pages. A transmitted page can be read by any number of clients, and we aim to minimise the total time taken to transmit all pages. Users impose additional constraints on how long they are willing to wait between pages, because of limited power supply in mobile devices. This problem is closely related to the multiple sequence alignment problem from bioinformatics. We present a first constraint model for this problem, designed for use with randomized local search algorithms. | en_US |
| dc.format.extent | 569116 bytes | en_US |
| dc.format.mimetype | application/pdf | en_US |
| dc.identifier.uri | https://dl.comp.nus.edu.sg/xmlui/handle/1900.100/1861 | en_US |
| dc.language.iso | en | en_US |
| dc.relation.ispartofseries | TR10/05 | en_US |
| dc.title | An Application of Constraint Programming to Mobile Data | en_US |
| dc.type | Technical Report | en_US |