57 search results - page 7 / 12 » Combinatorial algorithms for the minimum interval cost flow ... |
STACS
2001
Springer
14 years 4 days ago
2001
Springer
We consider the problem of computing an optimal range assignment in a wireless network which allows a specified source station to perform a broadcast operation. In particular, we ...
ICASSP
2011
IEEE
12 years 11 months ago
2011
IEEE
Abstract—Widely distributed multiple radar architectures offer parameter estimation improvement for target localization. For a large number of radars, the achievable localization...
NETWORKS
2002
13 years 7 months ago
2002
Consider a requirement graph whose vertices represent customers and an edge represents the need to route a unit of flow between its end vertices along a single path. All of these ...
ANCS
2007
ACM
13 years 11 months ago
2007
ACM
All-optical packet switching is a promising candidate for future high-speed switching. However, due to the absence of optical Random Access Memory, the traditional Virtual Output ...
MOBICOM
2006
ACM
14 years 1 months ago
2006
ACM
In many energy-constrained wireless sensor networks, nodes cooperatively forward correlated sensed data to data sinks. In order to reduce the communication cost (e.g. overall ener...