Sciweavers

929 search results - page 59 / 186
» heuristics 2008
Sort
View
ENTCS
2008
125views more  ENTCS 2008»
13 years 7 months ago
Can Refinement be Automated?
We automatically verify Back's atomicity refinement law and a classical data refinement law for action systems. Our novel approach mechanises a refinement calculus based on K...
Peter Höfner, Georg Struth
CSDA
2006
138views more  CSDA 2006»
13 years 7 months ago
Automatic dimensionality selection from the scree plot via the use of profile likelihood
Most dimension reduction techniques produce ordered coordinates so that only the first few coordinates need be considered in subsequent analyses. The choice of how many coordinate...
Mu Zhu, Ali Ghodsi
IEICET
2008
84views more  IEICET 2008»
13 years 7 months ago
Factorization of Square-Free Integers with High Bits Known
Abstract. In this paper we propose an algorithm of factoring any integer N which has k different prime factors with the same bit-length, when ( 1 k+2 + k(k-1) ) log N high-order bi...
Bagus Santoso, Noboru Kunihiro, Naoki Kanayama, Ka...
TCOS
2008
13 years 7 months ago
On Reduct Construction Algorithms
This paper critically analyzes reduct construction methods evels. At a high level, one can abstract commonalities from the existing algorithms, and classify them into three basic g...
Yiyu Yao, Yan Zhao, Jue Wang
TSP
2008
99views more  TSP 2008»
13 years 7 months ago
Filter Design With Low Complexity Coefficients
We introduce a heuristic for designing filters that have low complexity coefficients, as measured by the total number of nonzeros digits in the binary or canonic signed digit (CSD)...
Joelle Skaf, Stephen P. Boyd