Sciweavers

3136 search results - page 163 / 628
» Complex networks and evolutionary computation
Sort
View
WIOPT
2010
IEEE
15 years 2 months ago
On capacity achieving property of rotational coding for acyclic deterministic wireless networks
—It has been shown that the well-known cutset bounds can be achieved for deterministic wireless networks by performing random coding at each intermediate node. The complexity and...
Mohammad A. (Amir) Khojastepour, Alireza Keshavarz...
132
Voted
GECCO
2008
Springer
122views Optimization» more  GECCO 2008»
15 years 5 months ago
Evolving machine microprograms
The realization of a control unit can be done using a complex circuitry or microprogramming. The latter may be considered as an alternative method of implementation of machine ins...
Pedro A. Castillo Valdivieso, G. Fernández,...
TEC
2012
195views Formal Methods» more  TEC 2012»
13 years 6 months ago
The Effects of Constant and Bit-Wise Neutrality on Problem Hardness, Fitness Distance Correlation and Phenotypic Mutation Rates
Kimura’s neutral theory of evolution has inspired researchers from the evolutionary computation community to incorporate neutrality into Evolutionary Algorithms (EAs) in the hop...
Riccardo Poli, Edgar Galván López
ICN
2001
Springer
15 years 9 months ago
Evaluation of an Algorithm for Dynamic Resource Distribution in a Differentiated Services Network
New applications have been introduced to the today’s “best-effort” IP networks having different bandwidth and delay guarantee requirements. The IETF is currently focused on D...
Eugenia G. Nikolouzou, Petros Sampatakos, Iakovos ...
JMLR
2010
159views more  JMLR 2010»
14 years 11 months ago
Inference of Sparse Networks with Unobserved Variables. Application to Gene Regulatory Networks
Networks are becoming a unifying framework for modeling complex systems and network inference problems are frequently encountered in many fields. Here, I develop and apply a gener...
Nikolai Slavov