1984 search results - page 40 / 397 » The colourful feasibility problem |
MOR
2007
13 years 9 months ago
2007
The objective of the demand matching problem is to obtain the subset M of edges which is feasible and where the sum of the profits of each of the edges is maximized. The set M is...
CDC
2009
IEEE
13 years 7 months ago
2009
IEEE
In this paper, we investigate the cell design of bacteria during the exponential growth. To this purpose, we propose to formulate the problem as a non differentiable convex optimiz...
CEC
2007
IEEE
14 years 4 months ago
2007
IEEE
—Genetic Algorithms (GAs) have a good potential of solving the Gate Assignment Problem (GAP) at airport terminals, and the design of feasible and efficient evolutionary operators...
FPL
2000
Springer
14 years 1 months ago
2000
Springer
This paper describes a novel resource binding technique for use in multiple-wordlength systems implemented in FPGAs. It is demonstrated that the multiple-wordlength binding problem...
IBIS
2006
13 years 10 months ago
2006
: Schema matching is the task of finding semantic correspondences between elements of two schemas, which plays a key role in many database applications. In this paper, we cast the ...