3192 search results - page 54 / 639 » The minimum latency problem |
AAAI
1998
14 years 11 months ago
1998
Temporal plans permit significant flexibility in specifying the occurrence time of events. Plan execution can make good use of that flexibility. However, the advantage of executio...
CONEXT
2008
ACM
14 years 11 months ago
2008
ACM
One of the fundamental problems in the wireless sensor networks is the coverage problem. The coverage problem fundamentally address the quality of service (surveillance or monitor...
156
click to vote
SIAMCOMP
2011
14 years 24 days ago
2011
We consider the Minimum Linear Arrangement problem and the (Uniform) Sparsest Cut problem. So far, these two notorious NP-hard graph problems have resisted all attempts to prove in...
101
click to vote
ISAAC
2000
Springer
15 years 1 months ago
2000
Springer
It has been a challenging open problem whether there is a polynomial time approximation algorithm for the Vertex Cover problem whose approximation ratio is bounded by a constant l...
ICASSP
2011
IEEE
14 years 1 months ago
2011
IEEE
We consider spatio-temporal Tomlinson Harashima Precoding where the feedforward filter is located at the transmitter and an additional scalar gain is employed as receive filter....