Sciweavers

20017 search results - page 3695 / 4004
» Using personas effectively
Sort
View
APCSAC
2001
IEEE
15 years 9 months ago
Exploiting Java Instruction/Thread Level Parallelism with Horizontal Multithreading
Java bytecodes can be executed with the following three methods: a Java interpretor running on a particular machine interprets bytecodes; a Just-In-Time (JIT) compiler translates ...
Kenji Watanabe, Wanming Chu, Yamin Li
CGO
2003
IEEE
15 years 9 months ago
Optimal and Efficient Speculation-Based Partial Redundancy Elimination
Existing profile-guided partial redundancy elimination (PRE) methods use speculation to enable the removal of partial redundancies along more frequently executed paths at the expe...
Qiong Cai, Jingling Xue
146
Voted
GECCO
2000
Springer
15 years 9 months ago
Sampling Bias and Search Space Boundary Extension in Real Coded Genetic Algorithms
In Real coded genetic algorithms, some crossover operators do not work well on functions which have their optimum at the corner of the search space. To cope with this problem, we ...
Shigeyoshi Tsutsui
OODBS
2000
110views Database» more  OODBS 2000»
15 years 9 months ago
Opportunistic Prioritised Clustering Framework (OPCF)
Ever since the `early days' of database management systems, clustering has proven to be one of the most effective performance enhancement techniques for object oriented datab...
Zhen He, Alonso Marquez, Stephen Blackburn
DCC
1995
IEEE
15 years 9 months ago
Constrained-Storage Vector Quantization with a Universal Codebook
— Many image compression techniques require the quantization of multiple vector sources with significantly different distributions. With vector quantization (VQ), these sources ...
Sangeeta Ramakrishnan, Kenneth Rose, Allen Gersho
« Prev « First page 3695 / 4004 Last » Next »