4007 search results - page 223 / 802 » Computation with imprecise probabilities |
137
Voted
PPSN
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. We present a new method for proving lower bounds in evolutionary computation based on fitness-level arguments and an additional condition on transition probabilities bet...
145
click to vote
ECCV
2002
Springer
16 years 6 months ago
2002
Springer
We propose Markov chain Monte Carlo sampling methods to address uncertainty estimation in disparity computation. We consider this problem at a postprocessing stage, i.e. once the d...
139
Voted
TCS
2008
15 years 4 months ago
2008
Formalized study of self-assembly has led to the definition of the tile assembly model, a highly distributed parallel model of computation that may be implemented using molecules ...
154
click to vote
FOCS
2007
IEEE
15 years 10 months ago
2007
IEEE
d Abstract) Kousha Etessami LFCS, School of Informatics University of Edinburgh Mihalis Yannakakis Department of Computer Science Columbia University We reexamine what it means to...
154
click to vote
INFOCOM
2012
IEEE
13 years 6 months ago
2012
IEEE
Abstract—In this paper, we implement and evaluate three different Byzantine Fault-Tolerant (BFT) state machine replication protocols for data centers: (1) BASIC: The classic solu...