524 search results - page 95 / 105 » An Optimal Lower Bound on the Communication Complexity of Ga... |
GECCO
2005
Springer
14 years 1 months ago
2005
Springer
This paper focuses on the computation time of evolutionary algorithms. First, some exact expressions of the mean first hitting times of general evolutionary algorithms in finite...
SCOPES
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. Synthesis of digital signal processing (DSP) software from dataflow-based formal models is an effective approach for tackling the complexity of modern DSP applications. I...
CRYPTO
2000
Springer
14 years 8 hour ago
2000
Springer
Private information retrieval (PIR) enables a user to retrieve a data item from a database, replicated among one or more servers, while hiding the identity of the retrieved item. ...
GLOBECOM
2008
IEEE
14 years 2 months ago
2008
IEEE
— In this paper, distributed double-differential coding is proposed to avoid the problem of carrier offsets in amplify and forward protocol based cooperative network with two rel...
INFOCOM
2010
IEEE
13 years 6 months ago
2010
IEEE
Abstract—We study network optimization that considers energy minimization as an objective. Studies have shown that mechanisms such as speed scaling can significantly reduce the ...