Sciweavers

120 search results - page 13 / 24
» Experimenting with Deduction Modulo
Sort
View
ATAL
2006
Springer
15 years 6 months ago
Multiagent simulation meets the real world
To realize large scale socially embedded systems, this paper proposes a multiagent-based participatory design that consists of steps called 1) participatory simulation, where scen...
Toru Ishida
120
Voted
ICCAD
2005
IEEE
160views Hardware» more  ICCAD 2005»
15 years 11 months ago
Equivalence verification of polynomial datapaths with fixed-size bit-vectors using finite ring algebra
— This paper addresses the problem of equivalence verification of RTL descriptions. The focus is on datapathoriented designs that implement polynomial computations over fixed-s...
Namrata Shekhar, Priyank Kalla, Florian Enescu, Si...
ISSAC
2005
Springer
125views Mathematics» more  ISSAC 2005»
15 years 8 months ago
Generalized normal forms and polynomial system solving
This paper describes a new method for computing the normal form of a polynomial modulo a zero-dimensional ideal I. We give a detailed description of the algorithm, a proof of its ...
Bernard Mourrain
ANTS
2006
Springer
105views Algorithms» more  ANTS 2006»
15 years 6 months ago
A Modular Method for Computing the Splitting Field of a Polynomial
We provide a modular method for computing the splitting field Kf of an integral polynomial f by suitable use of the byproduct of computation of its Galois group Gf by p-adic Staudu...
Guénaël Renault, Kazuhiro Yokoyama
94
Voted
MP
2006
80views more  MP 2006»
15 years 2 months ago
Minimizing Polynomials via Sum of Squares over the Gradient Ideal
A method is proposed for finding the global minimum of a multivariate polynomial via sum of squares (SOS) relaxation over its gradient variety. That variety consists of all points ...
Jiawang Nie, James Demmel, Bernd Sturmfels