Sciweavers

951 search results - page 66 / 191
» On the Computation of Correctly-Rounded Sums
Sort
View
MFCS
2005
Springer
15 years 9 months ago
Explicit Inapproximability Bounds for the Shortest Superstring Problem
Abstract. Given a set of strings S = {s1, . . . , sn}, the Shortest Superstring problem asks for the shortest string s which contains each si as a substring. We consider two measur...
Virginia Vassilevska
126
Voted
ICCS
2004
Springer
15 years 9 months ago
Designing Digital Circuits for the Knapsack Problem
Abstract. Multi Expression Programming (MEP) is a Genetic Programming variant that uses linear chromosomes for solution encoding. A unique feature of MEP is its ability of encoding...
Mihai Oltean, Crina Grosan, Mihaela Oltean
ICES
2003
Springer
86views Hardware» more  ICES 2003»
15 years 9 months ago
A Note on Designing Logical Circuits Using SAT
Abstract. We present a systematic procedure for the synthesis and minimisation of digital circuits using propositional satisfiability. We encode the truth table into a canonical s...
Giovani Gomez Estrada
118
Voted
ASPDAC
1999
ACM
100views Hardware» more  ASPDAC 1999»
15 years 8 months ago
A Method for Evaluating Upper Bound of Simultaneous Switching Gates Using Circuit Partition
: This paper presents a method for evaluating an upper bound of simultaneous switching gates in combinational circuits. In this method, the original circuit is partitioned into sub...
Kai Zhang, Tsuyoshi Shinogi, Haruhiko Takase, Teru...
CDC
2009
IEEE
138views Control Systems» more  CDC 2009»
15 years 8 months ago
Semidefinite programming methods for system realization and identification
We describe semidefinite programming methods for system realization and identification. For each of these two applications, a variant of a simple subspace algorithm is presented, i...
Zhang Liu, Lieven Vandenberghe