Sciweavers

4377 search results - page 268 / 876
» Mass problems and randomness
Sort
View
AUSAI
2005
Springer
16 years 4 days ago
Neighborhood Re-structuring in Particle Swarm Optimization
This paper considers the use of randomly generated directed graphs as neighborhoods for particle swarm optimizers (PSO) using fully informed particles (FIPS), together with dynamic...
Arvind S. Mohais, Rui Mendes, Christopher Ward, Ch...
GECCO
2004
Springer
110views Optimization» more  GECCO 2004»
16 years 2 days ago
Grammatical Constant Creation
This study examines the utility of grammatical ephemeral random constants, and conducts an analysis of the preferences of evolutionary search when a number of different grammar ba...
Ian Dempsey, Michael O'Neill, Anthony Brabazon
ICEB
2004
175views Business» more  ICEB 2004»
15 years 8 months ago
Privacy-Preserving Data Mining in Electronic Surveys
Electronic surveys are an important resource in data mining. However, how to protect respondents' data privacy during the survey is a challenge to the security and privacy co...
Justin Z. Zhan, Stan Matwin
CORR
2006
Springer
142views Education» more  CORR 2006»
15 years 6 months ago
Decentralized Erasure Codes for Distributed Networked Storage
We consider the problem of constructing an erasure code for storage over a network when the data sources are distributed. Specifically, we assume that there are n storage nodes wit...
Alexandros G. Dimakis, Vinod M. Prabhakaran, Kanna...
CORR
2007
Springer
90views Education» more  CORR 2007»
15 years 6 months ago
Rateless coding with partial state information at the decoder
The problem of coding for channels with time-varying state is studied. Two different models are considered: one in which the channel state cannot depend on the transmitted signal,...
Anand D. Sarwate, Michael Gastpar