Sciweavers

1184 search results - page 40 / 237
» Memory Design for Constrained Dynamic Optimization Problems
Sort
View
ICCV
2009
IEEE
16 years 6 months ago
Constrained Clustering by Spectral Kernel Learning
Clustering performance can often be greatly improved by leveraging side information. In this paper, we consider constrained clustering with pairwise constraints, which specify s...
Zhenguo Li, Jianzhuang Liu
114
Voted
SPAA
2010
ACM
15 years 6 months ago
Towards optimizing energy costs of algorithms for shared memory architectures
Energy consumption by computer systems has emerged as an important concern. However, the energy consumed in executing an algorithm cannot be inferred from its performance alone: i...
Vijay Anand Korthikanti, Gul Agha
ISCA
2012
IEEE
243views Hardware» more  ISCA 2012»
13 years 4 months ago
BlockChop: Dynamic squash elimination for hybrid processor architecture
Hybrid processors are HW/SW co-designed processors that leverage blocked-execution, the execution of regions of instructions as atomic blocks, to facilitate aggressive speculative...
Jason Mars, Naveen Kumar
118
Voted
SASO
2008
IEEE
15 years 8 months ago
Evaporation as a Self-Adaptation Mechanism for PSO
This work extends the Particle Swarm Optimization (PSO) algorithm for working on dynamic environments. We propose an evaporation mechanism to solve the outdated memory problem. We...
Jose Luis Fernandez-Marquez, Josep Lluís Ar...
116
Voted
CAD
2000
Springer
15 years 1 months ago
Time-critical multiresolution rendering of large complex models
Very large and geometrically complex scenes, exceeding millions of polygons and hundreds of objects, arise naturally in many areas of interactive computer graphics. Time-critical ...
Enrico Gobbetti, Eric Bouvier