Sciweavers

42 search results - page 5 / 9
» Simple Effective Decipherment via Combinatorial Optimization
Sort
View
CIMCA
2005
IEEE
14 years 1 months ago
A Hybrid Estimation of Distribution Algorithm for the Minimal Switching Graph Problem
Minimal Switching Graph (MSG) is a graphical model for the constrained via minimization problem — a combinatorial optimization problem in integrated circuit design automation. F...
Maolin Tang, Raymond Y. K. Lau
ICS
2003
Tsinghua U.
14 years 24 days ago
Enhancing memory level parallelism via recovery-free value prediction
—The ever-increasing computational power of contemporary microprocessors reduces the execution time spent on arithmetic computations (i.e., the computations not involving slow me...
Huiyang Zhou, Thomas M. Conte
ICALP
2009
Springer
14 years 8 months ago
Correlation Clustering Revisited: The "True" Cost of Error Minimization Problems
Correlation Clustering was defined by Bansal, Blum, and Chawla as the problem of clustering a set of elements based on a possibly inconsistent binary similarity function between e...
Nir Ailon, Edo Liberty
CORR
2006
Springer
94views Education» more  CORR 2006»
13 years 7 months ago
Fitness Uniform Optimization
Abstract-- In evolutionary algorithms, the fitness of a population increases with time by mutating and recombining individuals and by a biased selection of more fit individuals. Th...
Marcus Hutter, Shane Legg
WWW
2008
ACM
13 years 7 months ago
Divide, Compress and Conquer: Querying XML via Partitioned Path-Based Compressed Data Blocks
We propose a novel Partition Path-Based (PPB) grouping strategy to store compressed XML data in a stream of blocks. In addition, we employ a minimal indexing scheme called Block S...
Wilfred Ng, Ho Lam Lau, Aoying Zhou