371 search results - page 32 / 75 » Partition Theorems and Computability Theory |
178
click to vote
Book
This is a great draft book about stochastic calculus and finance. It covers large number of topics such as Introduction to Probability Theory, Conditional Expectation, Arbitrage Pr...
80
Voted
GECCO
2009
Springer
15 years 4 months ago
2009
Springer
When an optimization problem is encoded using genetic algorithms, one must address issues of population size, crossover and mutation operators and probabilities, stopping criteria...
80
Voted
CC
2010
Springer
14 years 7 months ago
2010
Springer
We describe a randomized algorithm that, given an integer a, produces a certificate that the integer is not a pure power of an integer in expected (log a)1+o(1) bit operations unde...
66
Voted
FOCS
2008
IEEE
15 years 4 months ago
2008
IEEE
The deletion–contraction algorithm is perhaps the most popular method for computing a host of fundamental graph invariants such as the chromatic, flow, and reliability polynomi...
GG
2008
Springer
14 years 10 months ago
2008
Springer
Parallel and sequential independence are central concepts in the concurrency theory of the double pushout (dpo) approach to graph rewriting. However, so far those same notions were...