Sciweavers

356 search results - page 9 / 72
» Parallelizing time with polynomial circuits
Sort
View
IPPS
2010
IEEE
13 years 5 months ago
Prototype for a large-scale static timing analyzer running on an IBM Blue Gene
This paper focuses on parallelization of the classic static timing analysis (STA) algorithm for verifying timing characteristics of digital integrated circuits. Given ever-increasi...
Akintayo Holder, Christopher D. Carothers, Kerim K...
FCT
2007
Springer
13 years 11 months ago
On Approximating Optimal Weighted Lobbying, and Frequency of Correctness Versus Average-Case Polynomial Time
We investigate issues regarding two hard problems related to voting, the optimal weighted lobbying problem and the winner problem for Dodgson elections. Regarding the former, Chris...
Gábor Erdélyi, Lane A. Hemaspaandra,...
DNA
2006
Springer
129views Bioinformatics» more  DNA 2006»
13 years 11 months ago
P Systems with Active Membranes Characterize PSPACE
P system is a natural computing model inspired by behavior of living cells and their membranes. We show that (semi-)uniform families of P systems with active membranes can solve i...
Petr Sosík, Alfonso Rodríguez-Pat&oa...
ECCC
2002
74views more  ECCC 2002»
13 years 7 months ago
On the proper learning of axis parallel concepts
We study the proper learnability of axis-parallel concept classes in the PAC-learning and exactlearning models. These classes include union of boxes, DNF, decision trees and multi...
Nader H. Bshouty, Lynn Burroughs
CAP
2010
13 years 2 months ago
Polynomial homotopies on multicore workstations
Homotopy continuation methods to solve polynomial systems scale very well on parallel machines. In this paper we examine its parallel implementation on multiprocessor multicore wo...
Jan Verschelde, Genady Yoffe