Sciweavers

9949 search results - page 189 / 1990
» On the Network Complexity of Selection
Sort
View
ECAL
2007
Springer
15 years 10 months ago
Measuring Entropy in Embodied Neural Agents with Homeostasic Units: A Link Between Complexity and Cybernetics
Abstract. We present a model of a recurrent neural network with homeostasic units, embodied in a minimalist articulated agent with a single link and joint. The configuration of th...
Jorge Simão
ICASSP
2011
IEEE
14 years 8 months ago
Objective evaluation of the Dynamic Model Selection method for spectral voice conversion
Spectral voice conversion is usually performed using a single model selected in order to represent a tradeoff between goodness of fit and complexity. Recently, we proposed a new ...
Pierre Lanchantin, Xavier Rodet
TON
2008
99views more  TON 2008»
15 years 4 months ago
On the computational complexity and effectiveness of N-hub shortest-path routing
Abstract-- In this paper we study the computational complexity and effectiveness of a concept we term "N-hub ShortestPath Routing" in IP networks. N-hub Shortest-Path Rou...
Reuven Cohen, Gabi Nakibly
GECCO
2005
Springer
113views Optimization» more  GECCO 2005»
15 years 10 months ago
A multi-objective algorithm for DS-CDMA code design based on the clonal selection principle
This paper proposes a new algorithm based on the clonal selection principle for the design of spreading codes for DS-CDMA. The algorithm follows a multi-objective approach, genera...
Daniel Stevens, Sanjoy Das, Balasubramaniam Natara...
CORR
2008
Springer
114views Education» more  CORR 2008»
15 years 4 months ago
Dynamic index selection in data warehouses
Analytical queries defined on data warehouses are complex and use several join operations that are very costly, especially when run on very large data volumes. To improve response...
Stéphane Azefack, Kamel Aouiche, Jér...