2430 search results - page 363 / 486 » Computing Tutte Polynomials |
167
click to vote
GECCO
2005
Springer
15 years 11 months ago
2005
Springer
In Genetic algorithms it is not easy to evaluate the confidence level in whether a GA run may have missed a complete area of good points, and whether the global optimum was found....
143
click to vote
ICALP
2005
Springer
15 years 11 months ago
2005
Springer
We consider the problem of efficiently designing sets (codes) of equal-length DNA strings (words) that satisfy certain combinatorial constraints. This problem has numerous motivati...
157
click to vote
ICLP
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. In recent work, a general framework for specifying program correspondences under the answer-set semantics has been defined. The framework allows to define different not...
152
click to vote
PKC
2005
Springer
15 years 11 months ago
2005
Springer
Coppersmith, Franklin, Patarin, and Reiter show that given two RSA cryptograms xe mod N and (ax + b)e mod N for known constants a, b ∈ ZN , one can compute x in O(e log2 e) ZN -o...
162
click to vote
COLT
2004
Springer
15 years 11 months ago
2004
Springer
: We introduce a graph-theoretic generalization of classical Arrow-Debreu economics, in which an undirected graph specifies which consumers or economies are permitted to engage in...