— In this paper we develop a new dual decomposition method for optimizing a sum of convex objective functions corresponding to multiple agents but with coupled constraints. In ou...
?It is well-known that the problem of matching two relational structures can be posed as an equivalent problem of finding a maximal clique in a (derived) ?association graph.? Howev...
Marcello Pelillo, Kaleem Siddiqi, Steven W. Zucker
Many evolutionary algorithms have been lately developed for solving multiobjective problems, appealing or not to the Pareto optimality concept. Although, the evolutionary technique...
Fundamental to case-based reasoning is the idea that similar problems have similar solutions. The meaning of the concept of "similarity" can vary in different situations...
The assignment of orthologous genes between a pair of genomes is a fundamental and challenging problem in comparative genomics, since many computational methods for solving variou...
Zheng Fu, Xin Chen, Vladimir Vacic, Peng Nan, Yang...