Sciweavers

9949 search results - page 13 / 1990
» On the Network Complexity of Selection
Sort
View
LATIN
2010
Springer
14 years 2 months ago
Time Complexity of Distributed Topological Self-stabilization: The Case of Graph Linearization
Topological self-stabilization is an important concept to build robust open distributed systems (such as peer-to-peer systems) where nodes can organize themselves into meaningful n...
Dominik Gall, Riko Jacob, Andréa W. Richa, ...
GECCO
1999
Springer
133views Optimization» more  GECCO 1999»
13 years 11 months ago
Evolution of Goal-Directed Behavior from Limited Information in a Complex Environment
In this paper, we apply an evolutionary algorithm to learning behavior on a novel, interesting task to explore the general issue of learning e ective behaviors in a complex enviro...
Matthew R. Glickman, Katia P. Sycara
CLUSTER
2004
IEEE
13 years 7 months ago
Performance Evaluation of Shared Mesh Protection in WDM Networks
The efficient use of network capacity in shared restoration schemes strongly depends upon the path selection procedure. In this paper we propose and evaluate path selection algorit...
Chadi Assi, Ahmad Khalil, Nasir Ghani, Abdallah Sh...
ICAISC
2010
Springer
14 years 9 days ago
Quasi-parametric Recovery of Hammerstein System Nonlinearity by Smart Model Selection
In the paper we recover a Hammerstein system nonlinearity. Hammerstein systems, incorporating nonlinearity and dynamics, play an important role in various applications, and e¤ecti...
Zygmunt Hasiewicz, Grzegorz Mzyk, Przemyslaw Sliwi...
IJCNN
2007
IEEE
14 years 1 months ago
Search Strategies Guided by the Evidence for the Selection of Basis Functions in Regression
— This work addresses the problem of selecting a subset of basis functions for a model linear in the parameters for regression tasks. Basis functions from a set of candidates are...
Ignacio Barrio, Enrique Romero, Lluís Belan...