1806 search results - page 131 / 362 » Randomness and halting probabilities |
GECCO
2004
Springer
14 years 3 months ago
2004
Springer
Abstract. Evolutionary Algorithms (EAs) are population-based randomized optimizers often solving problems quite successfully. Here, the focus is on the possible effects of changin...
FSTTCS
2006
Springer
14 years 1 months ago
2006
Springer
Rounding a real-valued matrix to an integer one such that the rounding errors in all rows and columns are less than one is a classical problem. It has been applied to hypergraph co...
DAC
1997
ACM
14 years 1 months ago
1997
ACM
We propose a methodology for applying gate-level logic transformations to optimize power in digital circuits. Statistically simulated[14] switching information, gate delays, signa...
DCC
2005
IEEE
14 years 1 days ago
2005
IEEE
We derive an upper bound on the average MAP decoding error probability of random linear SW codes for arbitrary correlated stationary memoryless sources defined on Galois fields....
EDM
2008
13 years 11 months ago
2008
We compare the purposes, inputs, representations, and assumptions of three methods to evaluate the fine-grained interactions of intelligent tutors with their students. One method i...