94 search results - page 11 / 19 » Much to Know About History |
RECOMB
2003
Springer
14 years 9 months ago
2003
Springer
Although analysis of genome rearrangements was pioneered by Dobzhansky and Sturtevant 65 years ago, we still know very little about the rearrangement events that produced the exis...
CHES
2007
Springer
14 years 3 months ago
2007
Springer
The hardness of the integer factorization problem assures the security of some public-key cryptosystems including RSA, and the number field sieve method (NFS), the most efficient ...
AMAI
2004
Springer
14 years 2 months ago
2004
Springer
We study three new techniques which will speed up the branch-and-bound algorithm for the MAX-2-SAT problem: The first technique is a new lower bound function for the algorithm an...
PPPJ
2003
ACM
14 years 2 months ago
2003
ACM
Compared to imperative programming languages like Pascal or Basic, or functional programming languages like ML or Haskell learning Java is hampered by the fact that to get even th...
IPPS
1997
IEEE
14 years 1 months ago
1997
IEEE
Abstract. The incremental and dynamic construction of interconnection networks from smaller components often leaves the fundamental problem of assigning addresses to processors to ...