914 search results - page 34 / 183 » Branch and Bound on the Network Model |
CSJM
2006
14 years 9 months ago
2006
Traveling Salesman Problem (TSP) is a generic name that includes diverse practical models. Motivated by applications, a new model of TSP is examined -- a synthesis of classical TS...
106
Voted
GLOBECOM
2008
IEEE
15 years 4 months ago
2008
IEEE
—We consider the problem of joint routing, scheduling and power control in multi-hop wireless networks. We use a linear relation between link capacity and signal to interference ...
67
Voted
IJCNN
2000
IEEE
15 years 2 months ago
2000
IEEE
This paper proposes a method to solve problem that comes with imbalanced training sets which is often seen in the practical applications. We modi ed Self Growing Neural Network Co...
IJCSA
2006
14 years 9 months ago
2006
Artificial Neural Networks are universal and highly flexible function approximators first used in the fields of cognitive science and engineering. In recent years, Neural Networks...
PODC
2009
ACM
15 years 10 months ago
2009
ACM
d Abstract] Christoph Lenzen Computer Engineering and Networks Laboratory (TIK) ETH Zurich, 8092 Zurich, Switzerland lenzen@tik.ee.ethz.ch Thomas Locher Computer Engineering and N...