1291 search results - page 12 / 259 » Computing the multiplicity structure in solving polynomial s... |
STACS
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. This paper solves the unambiguity and the sequentiality problem for polynomially ambiguous min-plus automata. This result is proved through a decidable algebraic characte...
SYNTHESE
2008
13 years 7 months ago
2008
Abstract. Consciousness supervenes on activity; computation supervenes on structure. Because of this, some argue, conscious states cannot supervene on computational ones. If true, ...
COMPUTING
2006
13 years 7 months ago
2006
The polyhedral homotopy continuation method is known to be a successful method for finding all isolated solutions of a system of polynomial equations. PHoM, an implementation of t...
ICCS
2004
Springer
14 years 28 days ago
2004
Springer
Mathematical modeling of growing multicellular structures creates the problem of solving systems of equations in which not only the values of variables, but the equations themselv...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
The observation and modeling of natural Complex Systems (CSs) like the human nervous system, the evolution or the weather, allows the definition of special abilities and models re...