1040 search results - page 96 / 208 » Rounding algorithms for covering problems |
SPAA
2009
ACM
15 years 4 months ago
2009
ACM
We study deterministic, distributed algorithms for two weak variants of the standard graph coloring problem. We consider defective colorings, i.e., colorings where nodes of a colo...
IJFCS
2006
14 years 10 months ago
2006
Dynamically reconfigurable architectures offer extremely fast solutions to various problems. The Circuit Switched Tree (CST) is an important interconnect used to implement such ar...
114
click to vote
WIOPT
2006
IEEE
15 years 3 months ago
2006
IEEE
Abstract— An important application of wireless sensor networks is to perform the monitoring missions, for example, to monitor some targets of interests at all times. Sensors are ...
INFOCOM
2007
IEEE
15 years 4 months ago
2007
IEEE
Abstract— In wireless mesh networks, the end-to-end throughput of traffic flows depends on the path length, i.e. the higher the number of hops, the lower becomes the throughput...
ESA
2007
Springer
15 years 1 months ago
2007
Springer
A token is hidden in one out of n boxes following some known probability distribution and then all the boxes are locked. The goal of a searcher is to find the token in at most D n...