196 search results - page 17 / 40 » PHD |
KER
2008
13 years 9 months ago
2008
This article surveys existing practical implementations of both defeasible and argumentationbased reasoning engines and associated literature. We aim to summarise the current stat...
JSC
2007
13 years 9 months ago
2007
Buchberger’s Gr¨obner basis theory plays a fundamental role in symbolic computation. The resulting algorithms essentially carry out several S-polynomial reductions. In his PhD ...
JACM
2002
13 years 9 months ago
2002
An exponential lower bound on the circuit complexity of deciding the weak monadic second-order theory of one successor (WS1S) is proved. Circuits are built from binary operations, ...
CDC
2010
IEEE
13 years 4 months ago
2010
IEEE
Abstract-- Given a family of real or complex monic polynomials of fixed degree with one fixed affine constraint on their coefficients, consider the problem of minimizing the root r...
DSS
2011
13 years 1 months ago
2011
: We study a new supply chain network design problem with environmental concerns. We are interested in the environmental investments decisions in the design phase and propose a mul...