11740 search results - page 431 / 2348 » More Problems in Rewriting |
138
click to vote
CORR
2008
Springer
15 years 7 months ago
2008
Springer
Huffman coding finds an optimal prefix code for a given probability mass function. Consider situations in which one wishes to find an optimal code with the restriction that all cod...
136
click to vote
CORR
2008
Springer
15 years 7 months ago
2008
Springer
: In this paper, our focus is on certain applications for mobile robotic networks, where reconfiguration is driven by factors intrinsic to the network rather than changes in the ex...
134
click to vote
CORR
2008
Springer
15 years 7 months ago
2008
Springer
Given a probability distribution over a set of n words to be transmitted, the Huffman Coding problem is to find a minimal-cost prefix free code for transmitting those words. The b...
180
click to vote
EWC
2008
15 years 6 months ago
2008
In parallel adaptive mesh refinement (AMR) computations the problem size can vary significantly during a simulation. The goal here is to explore the performance implications of dyn...
199
click to vote
CSI
2006
15 years 6 months ago
2006
In a distributed system, a number of application tasks may need to be assigned to different processors such that the system cost is minimized and the constraints with limited reso...