6110 search results - page 433 / 1222 » Approximate Computing |
160
click to vote
ICCSA
2005
Springer
16 years 11 days ago
2005
Springer
Various global optimization methods are compared in order to find the best strategy to solve realistic drag reduction problems in the automotive industry. All the methods consist ...
161
click to vote
ARITH
2003
IEEE
16 years 4 days ago
2003
IEEE
This paper introduces a method for extracting the core of a Residue Number System (RNS) number within the RNS, this affording a new method for scaling RNS numbers. Suppose an RNS ...
199
click to vote
IRREGULAR
1995
Springer
15 years 10 months ago
1995
Springer
In this paper, we review parallel search techniques for approximating the global optimal solution of combinatorial optimization problems. Recent developments on parallel implementa...
300
click to vote
ICLP
2009
Springer
16 years 7 months ago
2009
Springer
Abstract. A class of probabilistic-logic models is considered, which increases the expressibility from HMM's and SCFG's regular and contextfree languages to, in principle...
192
click to vote
SPIRE
2010
Springer
15 years 5 months ago
2010
Springer
We initiate the study of the smoothed complexity of the Closest String problem by proposing a semi-random model of Hamming distance. We restrict interest to the optimization versio...