15033 search results - page 2809 / 3007 » Complexity Theory and Algorithms |
139
click to vote
INFOCOM
2010
IEEE
15 years 3 months ago
2010
IEEE
Abstract—We provide a formal model for the Change Management process for Enterprise IT systems, and develop change scheduling algorithms that seek to attain the “change capacit...
130
click to vote
INFOCOM
2010
IEEE
15 years 3 months ago
2010
IEEE
Abstract—By allowing routers to randomly mix the information content in packets before forwarding them, network coding can maximize network throughput in a distributed manner wit...
114
click to vote
JVCIR
2010
15 years 3 months ago
2010
Efficient representation of images usually leads to improvements in storage efficiency, computational complexity and performance of image processing algorithms. Efficient represe...
136
click to vote
LATIN
2010
Springer
15 years 3 months ago
2010
Springer
The packet routing problem, i.e., the problem to send a given set of unit-size packets through a network on time, belongs to one of the most fundamental routing problems with impor...
153
click to vote
PE
2010
Springer
15 years 3 months ago
2010
Springer
We introduce Bayesian Expansion (BE), an approximate numerical technique for passage time distribution analysis in queueing networks. BE uses a class of Bayesian networks to appro...