Sciweavers

1806 search results - page 138 / 362
» Randomness and halting probabilities
Sort
View
CORR
2000
Springer
91views Education» more  CORR 2000»
13 years 10 months ago
Algorithmic Theories of Everything
The probability distribution P from which the history of our universe is sampled represents a theory of everything or TOE. We assume P is formally describable. Since most (uncount...
Jürgen Schmidhuber
DEDS
2010
157views more  DEDS 2010»
13 years 7 months ago
On-line Optimal Control of a Class of Discrete Event Systems with Real-Time Constraints
We consider Discrete Event Systems (DES) involving tasks with real-time constraints and seek to control processing times so as to minimize a cost function subject to each task mee...
Jianfeng Mao, Christos G. Cassandras
PODC
2005
ACM
14 years 3 months ago
Routing complexity of faulty networks
One of the fundamental problems in distributed computing is how to efficiently perform routing in a faulty network in which each link fails with some probability. This paper inves...
Omer Angel, Itai Benjamini, Eran Ofek, Udi Wieder
HPCA
2007
IEEE
14 years 10 months ago
Implications of Device Timing Variability on Full Chip Timing
As process technologies continue to scale, the magnitude of within-die device parameter variations is expected to increase and may lead to significant timing variability. This pap...
Murali Annavaram, Ed Grochowski, Paul Reed
STOC
2001
ACM
97views Algorithms» more  STOC 2001»
14 years 10 months ago
Sharp threshold and scaling window for the integer partitioning problem
We consider the problem of partitioning n integers chosen randomly between 1 and 2m into two subsets such that the discrepancy, the absolute value of the difference of their sums,...
Christian Borgs, Jennifer T. Chayes, Boris Pittel