6409 search results - page 786 / 1282 » A Computational Algorithm for Origami Design |
144
Voted
ASIACRYPT
2000
Springer
15 years 9 months ago
2000
Springer
Abstract. Construction of secure hyperelliptic curves is of most important yet most difficult problem in design of cryptosystems based on the discrete logarithm problems on hyperel...
152
click to vote
VLSID
1996
IEEE
15 years 9 months ago
1996
IEEE
Simulated annealing based standard cell placement for VLSI designs has long been acknowledged as a compute-intensive process, and as a result several research efforts have been un...
190
click to vote
APPROX
2008
Springer
15 years 7 months ago
2008
Springer
Abstract. We give a (ln n + 1)-approximation for the decision tree (DT) problem. An instance of DT is a set of m binary tests T = (T1, . . . , Tm) and a set of n items X = (X1, . ....
140
click to vote
EVOW
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. Software configurable analogue arrays offer an intriguing platform for automated design by evolutionary algorithms. Like previous evolvable hardware experiments, these pl...
132
click to vote
SIGCOMM
2010
ACM
15 years 5 months ago
2010
ACM
Overload happens in Session Initiation Protocol (SIP) networks when SIP servers have insufficient resources to handle all messages they receive. Under overload, SIP networks suffe...