989 search results - page 91 / 198 » Approximating the Pareto optimal set using a reduced set of ... |
CEC
2007
IEEE
13 years 9 months ago
2007
IEEE
— Computational complexity is a major challenge in evolutionary algorithms due to their need for repeated fitness function evaluations. Here, we aim to reduce number of fitness f...
NIPS
2003
13 years 9 months ago
2003
We describe a nonparametric Bayesian approach to generalizing from few labeled examples, guided by a larger set of unlabeled objects and the assumption of a latent tree-structure ...
TOG
2008
13 years 7 months ago
2008
Processing of mesh edges lies at the core of many advanced realtime rendering techniques, ranging from shadow and silhouette computations, to motion blur and fur rendering. We pre...
ASPLOS
2008
ACM
13 years 10 months ago
2008
ACM
Many code analysis techniques for optimization, debugging, or parallelization need to perform runtime disambiguation of sets of addresses. Such operations can be supported efficie...
ICC
2007
IEEE
14 years 2 months ago
2007
IEEE
—Multicast is an important communication paradigm, also a problem well known for its difficulty (NP-completeness) to achieve certain optimization goals, such as minimum network ...