17185 search results - page 3139 / 3437 » Computational and Quantitative Studies |
180
click to vote
EUROCRYPT
2005
Springer
16 years 11 days ago
2005
Springer
A (1,2)-robust combiner for a cryptographic primitive P is a construction that takes two candidate schemes for P and combines them into one scheme that securely implement P even i...
179
click to vote
FCT
2005
Springer
16 years 11 days ago
2005
Springer
Usually, for bin packing problems, we try to minimize the number of bins used or in the case of the dual bin packing problem, maximize the number or total size of accepted items. ...
169
Voted
GECCO
2005
Springer
16 years 11 days ago
2005
Springer
We study if and when the inequality dp(H) ≤ rel∆(H) holds for schemas H in chromosomes that are structured as trees. The disruption probability dp(H) is the probability that a...
195
click to vote
GECCO
2005
Springer
16 years 11 days ago
2005
Springer
Any computational approach to design, including the use of evolutionary algorithms, requires the transformation of the domain-specific knowledge into a formal design representatio...
165
click to vote
ICALP
2005
Springer
16 years 10 days ago
2005
Springer
In this paper we initiate the study of discrete random variables over domains. Our work is inspired by work of Daniele Varacca, who devised indexed valuations as models of probabi...