4411 search results - page 569 / 883 » Communication Complexity and Its Applications |
170
click to vote
SCP
1998
15 years 6 months ago
1998
Consistency techniques are an e cient way of tackling constraint satisfaction problems (CSP). In particular, various arc-consistency algorithms have been designed such as the time...
163
click to vote
TIT
1998
15 years 6 months ago
1998
— The Godard or the constant modulus algorithm (CMA) is an effective technique for blind receiver design in communications. However, due to the complexity of the Constant Modulus...
194
click to vote
TDSC
2010
15 years 5 months ago
2010
—This paper presents the first hierarchical Byzantine fault-tolerant replication architecture suitable to systems that span multiple wide area sites. The architecture confines ...
221
click to vote
IMC
2010
ACM
15 years 4 months ago
2010
ACM
Cost control for the Internet access providers (AP) influences not only the nominal speeds offered to the customers, but also other, more controversial, policies related to traffi...
233
click to vote
IEEEIA
2009
15 years 4 months ago
2009
recently, mobile agents have been used to solve many problems in wireless sensor networks. Agents are usually transferred from a node to another to aggregate the sensed data and si...