1029 search results - page 127 / 206 » Neural Networks and Complexity Theory |
119
click to vote
FCT
2009
Springer
15 years 11 months ago
2009
Springer
In social network theory, a simple graph G is called k-role assignable if there is a surjective mapping that assigns a number from {1, . . . , k} called a role to each vertex of G ...
137
click to vote
GECCO
2006
Springer
15 years 8 months ago
2006
Springer
Many serious automobile accidents could be avoided if drivers were warned of impending crashes before they occur. Creating such warning systems by hand, however, is a difficult an...
121
click to vote
DEDS
2008
15 years 4 months ago
2008
Network calculus offers powerful tools to analyze the performances in communication networks, in particular to obtain deterministic bounds. This theory is based on a strong mathema...
132
click to vote
AIMS
2009
Springer
15 years 11 months ago
2009
Springer
Ontological modelling for machine inference has featured prominently in IT management research recently, but there is more immediate scope for knowledge modelling in the realm of h...
148
click to vote
CCIW
2009
Springer
15 years 11 months ago
2009
Springer
The paper presents a novel Motor Map neural network for re-indexing color mapped images. The overall learning process is able to smooth the local spatial redundancy of the indexes ...