254 search results - page 29 / 51 » On randomized one-round communication complexity |
EVOW
2009
Springer
14 years 2 months ago
2009
Springer
In this paper we propose a new tabu search hyperheuristic which makes individual low level heuristics tabu dynamically using an analogy with the Binary Exponential Back Off (BEBO) ...
TAMC
2009
Springer
14 years 2 months ago
2009
Springer
We study a new model of computation called stream checking on graph problems where a space-limited verifier has to verify a proof sequentially (i.e., it reads the proof as a strea...
ICCCN
2007
IEEE
14 years 2 months ago
2007
IEEE
—This paper focuses on the use of specific interleaving techniques for use in W-CDMA (Wideband Code Division Multiple Access). The linear equalization algorithm usually performs ...
GLOBECOM
2006
IEEE
14 years 1 months ago
2006
IEEE
— A non-parametric, low-complexity algorithm for accurate and simultaneous localization of multiple sensors from scarce and imperfect ranging information is proposed. The techniq...
SEFM
2005
IEEE
14 years 1 months ago
2005
IEEE
The development of test cases is an important issue for testing software, communication protocols and other reactive systems. A number of methods are known for the development of ...