1291 search results - page 15 / 259 » Computing the multiplicity structure in solving polynomial s... |
AIPS
1994
14 years 10 months ago
1994
In this work we present an approach to solving time-critical decision-making problems by taking advantage of domain structure to expand the amountof time available for processing ...
90
Voted
ENTCS
2008
14 years 9 months ago
2008
Computational origami is the computer assisted study of mathematical and computational aspects of origami. An origami is constructed by a finite sequence of fold steps, each consi...
103
click to vote
SODA
2010
ACM
14 years 7 months ago
2010
ACM
We present an exact algorithm that decides, for every fixed r ≥ 2 in time O(m) + 2O(k2 ) whether a given multiset of m clauses of size r admits a truth assignment that satisfi...
SRDS
2006
IEEE
15 years 3 months ago
2006
IEEE
Failure models characterise the expected component failures in fault-tolerant computing. In the context of distributed systems, a failure model usually consists of two parts: a fu...
JSC
2011
14 years 11 days ago
2011
In 1974, Johnson showed how to multiply and divide sparse polynomials using a binary heap. This paper introduces a new algorithm that uses a heap to divide with the same complexit...