16091 search results - page 3007 / 3219 » Solving |
262
click to vote
NLP
2000
15 years 8 months ago
2000
Abstract. The purpose of this paper is (1) to provide a theoretical justification for the use of Monte-Carlo sampling for approximate resolution of NP-hard maximization problems in...
195
Voted
PKC
2000
Springer
15 years 8 months ago
2000
Springer
A number of signature schemes and standards have been recently designed, based on the Discrete Logarithm problem. In this paper we conduct design validation of such schemes while t...
126
Voted
SAIG
2000
Springer
15 years 8 months ago
2000
Springer
The phrase optimal program specialization" was de ned by Jones et al. in 1993 to capture the idea of a specializer being strong enough to remove entire layers of interpretatio...
157
click to vote
SPW
2000
Springer
15 years 8 months ago
2000
Springer
In the context of the security of wireless ad hoc networks, we previously explored the problem of secure transient association between a master and a slave device in the absence of...
166
Voted
ECAL
1995
Springer
15 years 8 months ago
1995
Springer
After an outline of the history of evolutionary algorithms, a new ( ) variant of the evolution strategies is introduced formally. Though not comprising all degrees of freedom, it i...