Sciweavers

619 search results - page 7 / 124
» Generic Extensions and Generic Polynomials
Sort
View
CORR
2011
Springer
186views Education» more  CORR 2011»
13 years 2 months ago
On the Complexity of Solving a Bivariate Polynomial System
We study the complexity of computing the real solutions of a bivariate polynomial system using the recently proposed algorithm Bisolve [3]. Bisolve is a classical elimination metho...
Pavel Emeliyanenko, Michael Sagraloff
FPL
2003
Springer
128views Hardware» more  FPL 2003»
14 years 25 days ago
A Generic Architecture for Integrated Smart Transducers
Abstract. A smart transducer network hosts various nodes with different functionality. Our approach offers the possibility to design different smart transducer nodes as a system...
Martin Delvai, Ulrike Eisenmann, Wilfried Elmenrei...
MOR
2002
94views more  MOR 2002»
13 years 7 months ago
The Complexity of Generic Primal Algorithms for Solving General Integer Programs
ngly better objective function value until an optimal solution is reached. From an abstract point of view, an augmentation problem is solved in each iteration. That is, given a fea...
Andreas S. Schulz, Robert Weismantel
IDEAS
2000
IEEE
108views Database» more  IDEAS 2000»
14 years 5 hour ago
Plug and Play with Query Algebras: SECONDO-A Generic DBMS Development Environment
We present SECONDO, a new generic environment supporting the implementation of database systems for a wide range of data models and query languages. On the one hand, this framewor...
Stefan Dieker, Ralf Hartmut Güting
AB
2008
Springer
14 years 2 months ago
Investigating Generic Methods to Solve Hopf Bifurcation Problems in Algebraic Biology
Abstract. Symbolic methods for investigating Hopf bifurcation problems of vector fields arising in the context of algebraic biology have recently obtained renewed attention. Howev...
Thomas Sturm, Andreas Weber 0004