Sciweavers

117 search results - page 15 / 24
» Run-Time Bytecode Specialization
Sort
View
EVOW
2010
Springer
14 years 4 months ago
Enhancing Genetic Algorithms by a Trie-Based Complete Solution Archive
Genetic algorithms (GAs) share a common weakness with most other metaheuristics: Candidate solutions are in general revisited multiple times, lowering diversity and wasting preciou...
Günther R. Raidl, Bin Hu
ACSC
2009
IEEE
14 years 4 months ago
Microdata Protection Through Approximate Microaggregation
Microdata protection is a hot topic in the field of Statistical Disclosure Control, which has gained special interest after the disclosure of 658000 queries by the America Online...
Xiaoxun Sun, Hua Wang, Jiuyong Li
CEC
2009
IEEE
14 years 4 months ago
GPU-based parallel particle swarm optimization
— A novel parallel approach to run standard particle swarm optimization (SPSO) on Graphic Processing Unit (GPU) is presented in this paper. By using the general-purpose computing...
You Zhou, Ying Tan
DSN
2007
IEEE
14 years 4 months ago
Superscalar Processor Performance Enhancement through Reliable Dynamic Clock Frequency Tuning
Synchronous circuits are typically clocked considering worst case timing paths so that timing errors are avoided under all circumstances. In the case of a pipelined processor, thi...
Viswanathan Subramanian, Mikel Bezdek, Naga Durga ...
FOCS
2007
IEEE
14 years 4 months ago
Can you beat treewidth?
: It is well-known that constraint satisfaction problems (CSP) over an unbounded domain can be solved in time nO(k) if the treewidth of the primal graph of the instance is at most ...
Dániel Marx