14518 search results - page 235 / 2904 » Two Problems for Sophistication |
118
click to vote
AAECC
2006
Springer
15 years 26 days ago
2006
Springer
So-called nonadjacent representations are commonly used in elliptic curve cryptography to facilitate computing a scalar multiple of a point on an elliptic curve. A nonadjacent rep...
115
Voted
ENTCS
2006
15 years 24 days ago
2006
This paper extends the domain theoretic method for solving initial value problems, described in [8], to unbounded vector fields. Based on a sequence of approximations of the vecto...
106
Voted
JSAT
2008
15 years 23 days ago
2008
We analyze, in this work, the performance of a recently introduced weighted Max-SAT solver, Clone, in the Max-SAT evaluation 2007. Clone utilizes a novel bound computation based o...
143
click to vote
NCA
2008
IEEE
15 years 22 days ago
2008
IEEE
The paper focuses on the study of solving the large-scale traveling salesman problem (TSP) based on neurodynamic programming. From this perspective, two methods, temporal differenc...
108
Voted
MOR
2006
15 years 22 days ago
2006
Abstract. We solve the Poisson disorder problem when the delay is penalized exponentially. Our objective is to detect as quickly as possible the unobservable time of the change (or...