465 search results - page 30 / 93 » On the Hardness of Range Assignment Problems |
CP
2005
Springer
15 years 5 months ago
2005
Springer
We present a new and more efficient heuristic by restricting lookahead saturation (LAS) with NVO (neighbourhood variable ordering) and DEW (dynamic equality weighting). We report o...
127
click to vote
JNCA
2011
14 years 6 months ago
2011
Built upon a shared wireless medium, wireless mesh network is particularly vulnerable to jamming attacks. The ability to recover from attacks and maintain an acceptable level of s...
RECOMB
2005
Springer
16 years 4 days ago
2005
Springer
Abstract. The objective function of the genome rearrangement problems allows the integration of other genome-level problems so that they may be solved simultaneously. Three example...
SIGMETRICS
2010
ACM
15 years 4 months ago
2010
ACM
In this paper, we study distributed channel assignment in wireless networks with applications to peer discovery in ad hoc wireless networks. We model channel assignment as a color...
ICIP
2009
IEEE
14 years 9 months ago
2009
IEEE
Existing digital image composition algorithms neglect the out-of-gamut problem, i.e. some pixel values in a composited image exceed the displayable or printable range. In this pap...