Sciweavers

1291 search results - page 14 / 259
» Computing the multiplicity structure in solving polynomial s...
Sort
View
CIE
2009
Springer
14 years 2 months ago
Decidability of Sub-theories of Polynomials over a Finite Field
Abstract. Let Fq be a finite field with q elements. We produce an (effective) elimination of quantifiers for the structure of the set of polynomials, Fq[t], of one variable, in...
Alla Sirokofskich
DATE
2010
IEEE
134views Hardware» more  DATE 2010»
14 years 19 days ago
Simultaneous budget and buffer size computation for throughput-constrained task graphs
Abstract—Modern embedded multimedia systems process multiple concurrent streams of data processing jobs. Streams often have throughput requirements. These jobs are implemented on...
Maarten Wiggers, Marco Bekooij, Marc Geilen, Twan ...
ESCIENCE
2005
IEEE
14 years 1 months ago
A Distributed Problem Solving Environment (PSE) for Scientific Computing
A distributed Problem Solving Environment (PSE) is proposed to help users solve partial differential equation (PDE) based problems in scientific computing. The system inputs a pro...
Shigeo Kawata, Hideaki Fuju, Hideaki Sugiura, Yuic...
AGP
1999
IEEE
13 years 12 months ago
ACI1 constraints
Disunification is the problem of deciding satisfiability of a system of equations and disequations with respect to a given equational theory. In this paper we study the disunifica...
Agostino Dovier, Carla Piazza, Enrico Pontelli, Gi...
WSC
2008
13 years 10 months ago
Solving volume and capacity planning problems in semiconductor manufaturing: A computational study
In this paper, we suggest a linear programming formulation that allows for solving volume and capacity planning problems in semiconductor manufacturing systems. We assume a genera...
Christoph Habla, Lars Mönch