229 search results - page 2 / 46 » Dynamic Algorithms for Recoverable Robustness Problems |
EVOW
2005
Springer
13 years 11 months ago
2005
Springer
Non-random mating seems to be the norm in nature among sexual organisms. A common mating criteria among animals is assortative mating, where individuals mate according to their phe...
ANTSW
2010
Springer
13 years 15 days ago
2010
Springer
Abstract. We consider the problem of finding and maintaining communication paths in wireless mobile ad hoc networks (MANET). We consider this problem as a bi-objective problem when...
JCO
2002
13 years 5 months ago
2002
The single machine scheduling problem with sum of completion times criterion (SS) can be solved easily by the Shortest Processing Time (SPT) rule. In the case of significant uncert...
ICDCSW
2005
IEEE
13 years 11 months ago
2005
IEEE
Recent researches have highlighted the importance of developing a network with distributed problem solving abilities thus enhancing reliability with equal share of network resourc...
ICIP
2003
IEEE
14 years 7 months ago
2003
IEEE
Principal Component Analysis (PCA) is a well-established technique in image processing and pattern recognition. Incremental PCA and robust PCA are two interesting problems with nu...