3142 search results - page 573 / 629 » Solving Hierarchical Optimization Problems Using MOEAs |
KDD
2008
ACM
14 years 9 months ago
2008
ACM
Privacy-preserving data mining (PPDM) is an emergent research area that addresses the incorporation of privacy preserving concerns to data mining techniques. In this paper we prop...
CCO
2001
Springer
14 years 1 months ago
2001
Springer
Branch, cut, and price (BCP) is an LP-based branch and bound technique for solving large-scale discrete optimization problems (DOPs). In BCP, both cuts and variables can be generat...
GECCO
2008
Springer
13 years 10 months ago
2008
Springer
We propose a new class of crossover operators for genetic algorithms (CrossNet) which use a network-based (or graphbased) chromosomal representation. We designed CrossNet with the...
CLUSTER
2008
IEEE
2008
IEEE
A trace-driven emulation framework to predict scalability of large clusters in presence of OS Jitter
14 years 3 months ago
—Various studies have pointed out the debilitating effects of OS Jitter on the performance of parallel applications on large clusters such as the ASCI Purple and the Mare Nostrum...
DAC
2009
ACM
14 years 10 months ago
2009
ACM
Efficient system-level design is increasingly relying on hierarchical design-space exploration, as well as compositional methods, to shorten time-to-market, leverage design re-use...