Sciweavers

849 search results - page 58 / 170
» The Early Restart Algorithm
Sort
View
AMC
2007
115views more  AMC 2007»
15 years 23 days ago
Evolutionary programming based on non-uniform mutation
Abstract–A new evolutionary programming algorithm (NEP) using the non-uniform mutation operator instead of Gaussian or Cauchy mutation operators is proposed. NEP has the merits o...
Xinchao Zhao, Xiao-Shan Gao, Ze-Chun Hu
WWW
2010
ACM
15 years 7 months ago
Optimal rare query suggestion with implicit user feedback
Query suggestion has been an effective approach to help users narrow down to the information they need. However, most of existing studies focused on only popular/head queries. Si...
Yang Song, Li-wei He
117
Voted
CORR
2011
Springer
143views Education» more  CORR 2011»
14 years 4 months ago
Towards Understanding and Harnessing the Potential of Clause Learning
Efficient implementations of DPLL with the addition of clause learning are the fastest complete Boolean satisfiability solvers and can handle many significant real-world problem...
Paul Beame, Henry A. Kautz, Ashish Sabharwal
102
Voted
ICCAD
2001
IEEE
111views Hardware» more  ICCAD 2001»
15 years 9 months ago
Congestion Aware Layout Driven Logic Synthesis
In this paper, we present novel algorithms that effectively combine physical layout and early logic synthesis to improve overall design quality. In addition, we employ partitionin...
Thomas Kutzschebauch, Leon Stok
138
Voted
SDM
2012
SIAM
224views Data Mining» more  SDM 2012»
13 years 3 months ago
Nearest-Neighbor Search on a Time Budget via Max-Margin Trees
Many high-profile applications pose high-dimensional nearest-neighbor search problems. Yet, it still remains difficult to achieve fast query times for state-of-the-art approache...
Parikshit Ram, Dongryeol Lee, Alexander G. Gray