6409 search results - page 97 / 1282 » A Computational Algorithm for Origami Design |
ISSAC
2007
Springer
15 years 7 months ago
2007
Springer
Approximate symbolic computation problems can be formulated as constrained or unconstrained optimization problems, for example: GCD [3, 8, 12, 13, 23], factorization [5, 10], and ...
DAC
2006
ACM
16 years 2 months ago
2006
ACM
Design space exploration during high level synthesis is often conducted through ad-hoc probing of the solution space using some scheduling algorithm. This is not only time consumi...
ISMB
2000
15 years 2 months ago
2000
The repetitive structure of genomic DNA holds many secrets to be discovered. A systematic study of repetitive DNA on a genomic or inter-genomic scale requires extensive algorithmi...
101
click to vote
CRYPTO
1992
Springer
15 years 5 months ago
1992
Springer
Numerous cryptosystems have been designed to be secure under the assumption that the computation of discrete logarithms is infeasible. This paper reports on an aggressive attempt ...
105
click to vote
IPPS
2006
IEEE
15 years 7 months ago
2006
IEEE
Graph alliances are recently developed global properties of any symmetric graph. Our purpose in the present paper is to design self-stabilizing fault tolerant distributed algorith...