2863 search results - page 173 / 573 » Constructing minimum-interference networks |
111
Voted
SOFSEM
1997
Springer
15 years 7 months ago
1997
Springer
: In this paper we rst present a general lower bound on the stabilization time which holds for a number of graph theoretic problems, including leader election, spanning tree constr...
136
Voted
ANSS
1991
IEEE
15 years 7 months ago
1991
IEEE
This paper first summerizes and then presents a formal proof to a new conservative deadlock-free algorithm, YADDES [l], for asynchronous discrete event simulation. The proof not o...
94
Voted
ESANN
2007
15 years 5 months ago
2007
Abstract. Our work is concerned with finding optimum connection strategies in highperformance associative memory models. Taking inspiration from axonal branching in biological neur...
104
Voted
LREC
2008
15 years 5 months ago
2008
We present a study of the word interaction networks of Bengali in the framework of complex networks. The topological properties of these networks reveal interesting insights into ...
100
Voted
ESANN
2003
15 years 4 months ago
2003
Training an ensemble of networks is an interesting way to improve the performance with respect to a single network. However there are several method to construct the ensemble and t...