Sciweavers

7195 search results - page 799 / 1439
» On Computing Power
Sort
View
209
Voted
TASE
2008
IEEE
15 years 7 months ago
New Hybrid Optimization Algorithms for Machine Scheduling Problems
Dynamic programming, branch-and-bound, and constraint programming are the standard solution principles for nding optimal solutions to machine scheduling problems. We propose a new ...
Yunpeng Pan, Leyuan Shi
EGH
2011
Springer
14 years 7 months ago
Lossless Compression of Already Compressed Textures
Texture compression helps rendering by reducing the footprint in graphics memory, thus allowing for more textures, and by lowering the number of memory accesses between the graphi...
Jacob Ström, Per Wennersten
194
Voted
QOSA
2007
Springer
16 years 1 months ago
Extending the Capabilities of Component Models for Embedded Systems
Component-based development helps to improve the modularity and reusability of embedded systems. Component models devised for embedded systems are typically restricted due to the l...
Ihor Kuz, Yan Liu
209
Voted
WOSP
2005
ACM
16 years 25 days ago
Applying SPE techniques for modeling a grid-enabled JAVA platform
Advances in Internet and the availability of powerful computers and high-speed networks have propitiated the rise of Grids. The scheduling of applications is complex in Grids due ...
Mariela Curiel, M. Angélica Pérez, R...
CF
2005
ACM
15 years 9 months ago
Reversible logic for supercomputing
This paper is about making reversible logic a reality for supercomputing. Reversible logic offers a way to exceed certain basic limits on the performance of computers, yet a power...
Erik DeBenedictis