161 search results - page 1 / 33 » Transforming general networks into feed-forward by using tur... |
INFOCOM
2002
IEEE
13 years 9 months ago
2002
IEEE
Abstract— Network calculus is known to apply in general only to feedforward routing networks, i.e., networks where routes do not create cycles of interdependent packet flows. In...
GECCO
2003
Springer
13 years 10 months ago
2003
Springer
Abstract. In developing algorithms that dynamically changes the structure and weights of ANN (Artificial Neural Networks), there must be a proper balance between network complexit...
MMB
2010
Springer
13 years 9 months ago
2010
Springer
Abstract. Computing tight performance bounds in feed-forward networks under general assumptions about arrival and server models has turned out to be a challenging problem. Recently...
WCE
2007
13 years 6 months ago
2007
— This work is to apply wavelet packet transformation for the recognition of isolated handwritten Malayalam (one of the south Indian languages) characters. The key idea is that c...
COMCOM
2008
13 years 5 months ago
2008
The issue of breaking cycles in communication networks is an important topic for several reasons. For instance, it is required when transparent bridges are filling the forwarding ...