Abstract. STP is a decision procedure for the satisfiability of quantifier-free formulas in the theory of bit-vectors and arrays that has been optimized for large problems encoun...
Academic literature has documented for a long time the existence of important price gains in the first trading day of initial public offerings (IPOs). Most of the empirical analys...
Negative selection algorithms for hamming and real-valued shape-spaces are reviewed. Problems are identified with the use of these shape-spaces, and the negative selection algori...
Thomas Stibor, Philipp H. Mohr, Jonathan Timmis, C...
Parallel discrete event simulation techniques have enabled the realization of large-scale models of communication networks containing millions of end hosts and routers. However, t...
Alfred Park, Richard M. Fujimoto, Kalyan S. Peruma...
Many polynomial factorization algorithms rely on Hensel lifting and factor recombination. For bivariate polynomials we show that lifting the factors up to a precision linear in th...