Sciweavers

2446 search results - page 72 / 490
» Choiceless Polynomial Time
Sort
View
JC
2007
119views more  JC 2007»
13 years 7 months ago
Factoring bivariate sparse (lacunary) polynomials
We present a deterministic algorithm for computing all irreducible factors of degree ≤ d of a given bivariate polynomial f ∈ K[x, y] over an algebraic number field K and their...
Martin Avendano, Teresa Krick, Martín Sombr...
GECCO
2004
Springer
14 years 1 months ago
Bounding Learning Time in XCS
It has been shown empirically that the XCS classifier system solves typical classification problems in a machine learning competitive way. However, until now, no learning time es...
Martin V. Butz, David E. Goldberg, Pier Luca Lanzi
ICCAD
2007
IEEE
108views Hardware» more  ICCAD 2007»
14 years 4 months ago
A frequency-domain technique for statistical timing analysis of clock meshes
—We propose a frequency-domain modeling technique with applications on the statistical timing analysis of clock mesh/grid networks. Using transmission lines to model clock mesh e...
Ruilin Wang, Cheng-Kok Koh
IPPS
2007
IEEE
14 years 2 months ago
Constant Time Simulation of an R-Mesh on an LR-Mesh
Recently, many parallel computing models using dynamically reconfigurable electrical buses have been proposed in the literature. The underlying characteristics are similar among ...
Carlos Alberto Córdova-Flores, José ...
CONCUR
2004
Springer
14 years 1 months ago
Model Checking Timed Automata with One or Two Clocks
In this paper, we study model checking of timed automata (TAs), and more precisely we aim at finding efficient model checking for subclasses of TAs. For this, we consider model ch...
François Laroussinie, Nicolas Markey, Ph. S...