Sciweavers

667 search results - page 109 / 134
» Computably Based Locally Compact Spaces
Sort
View
ICIC
2005
Springer
14 years 1 months ago
A Sequential Niching Technique for Particle Swarm Optimization
This paper proposed a modified algorithm, sequential niching particle swarm optimization (SNPSO), for the attempt to get multiple maxima of multimodal function. Based on the sequen...
Jun Zhang, Jing-Ru Zhang, Kang Li
TROB
2008
159views more  TROB 2008»
13 years 7 months ago
Distributed Connectivity Control of Mobile Networks
Control of mobile networks raises fundamental and novel problems in controlling the structure of the resulting dynamic graphs. In particular, in applications involving mobile senso...
Michael M. Zavlanos, George J. Pappas
EVOW
2011
Springer
12 years 11 months ago
iSoundScape: Adaptive Walk on a Fitness Soundscape
Adaptive walk on a fitness soundscape [7] is a new kind of interactive evolutionary computation for musical works. This system provides a virtual two-dimensional grid called a “...
Reiji Suzuki, Souichiro Yamaguchi, Martin L. Cody,...
ICDT
2010
ACM
211views Database» more  ICDT 2010»
14 years 5 months ago
Probabilistic Data Exchange
The work reported here lays the foundations of data exchange in the presence of probabilistic data. This requires rethinking the very basic concepts of traditional data exchange, ...
Ronald Fagin, Benny Kimelfeld, Phokion Kolaitis
AUSDM
2007
Springer
193views Data Mining» more  AUSDM 2007»
14 years 2 months ago
Are Zero-suppressed Binary Decision Diagrams Good for Mining Frequent Patterns in High Dimensional Datasets?
Mining frequent patterns such as frequent itemsets is a core operation in many important data mining tasks, such as in association rule mining. Mining frequent itemsets in high-di...
Elsa Loekito, James Bailey