Sciweavers

129 search results - page 3 / 26
» Scale-free, self-organizing very large sensor networks
Sort
View
GECCO
2005
Springer
220views Optimization» more  GECCO 2005»
14 years 3 months ago
Scale invariant pareto optimality: a meta--formalism for characterizing and modeling cooperativity in evolutionary systems
This article describes a mathematical framework for characterizing cooperativity in complex systems subject to evolutionary pressures. This framework uses three foundational compo...
Mark Fleischer
JPDC
2010
66views more  JPDC 2010»
13 years 8 months ago
Scale-free, self-organizing very large sensor networks
Dan C. Marinescu, Chen Yu, Gabriela M. Marinescu
ICCCN
2007
IEEE
14 years 4 months ago
On Improving the Precision of Localization with Minimum Resource Allocation
— Autonomous localization of nodes in wireless sensor networks is essential to minimize the complex self organization task and consequently enhancing the overall network lifetime...
Frank Reichenbach, Dirk Timmermann
IDEAL
2005
Springer
14 years 3 months ago
Bearing Similarity Measures for Self-organizing Feature Maps
The neural representation of space in rats has inspired many navigation systems for robots. In particular, Self-Organizing (Feature) Maps (SOM) are often used to give a sense of lo...
Narongdech Keeratipranon, Frédéric M...
IOR
2011
175views more  IOR 2011»
13 years 4 months ago
Clique Relaxations in Social Network Analysis: The Maximum k-Plex Problem
This paper introduces and studies the maximum k-plex problem, which arises in social network analysis and has wider applicability in several important areas employing graph-based ...
Balabhaskar Balasundaram, Sergiy Butenko, Illya V....