241 search results - page 35 / 49 » Fast heuristics for large scale covering-location problems |
GECCO
2007
Springer
15 years 3 months ago
2007
Springer
The research area of evolutionary multiobjective optimization (EMO) is reaching better understandings of the properties and capabilities of EMO algorithms, and accumulating much e...
69
Voted
RECOMB
1998
Springer
15 years 1 months ago
1998
Springer
The task of computing molecular structure from combinations of experimental and theoretical constraints is expensive because of the large number of estimated parameters (the 3D co...
ISQED
2002
IEEE
15 years 2 months ago
2002
IEEE
This paper presents a fast algorithm to optimize both the widths and lengths of power/ground networks under reliability and power dip/ground bounce constraints. The spacesizing wh...
93
Voted
IPPS
2009
IEEE
15 years 4 months ago
2009
IEEE
We introduce the coupled placement problem for modern data centers spanning placement of application computation and data among available server and storage resources. While the t...
106
click to vote
INFOCOM
2000
IEEE
15 years 1 months ago
2000
IEEE
The ability to classify packets according to pre-defined rules is critical to providing many sophisticated value-added services, such as security, QoS, load balancing, traffic acco...