4 search results - page 1 / 1 » Maximum H-colourable subdigraphs and constraint optimization... |
JCSS
2007
13 years 5 months ago
2007
TSP
2010
13 years 7 hour ago
2010
The adaptive estimation of a time-varying parameter vector in a linear Gaussian model is considered where we a priori know that the parameter vector belongs to a known arbitrary s...
SPAA
1999
ACM
13 years 9 months ago
1999
ACM
The time-constrained packet routing problem is to schedule a set of packets to be transmitted through a multinode network, where every packet has a source and a destination (as in ...
ISCAS
2006
IEEE
13 years 11 months ago
2006
IEEE
the following cost functions: In this paper, learning rules are proposed for simultaneous corn- GI(U) = tr{(UTU)(UTBU)-lD, (la) putation of minor eigenvectors of a covariance matri...