Sciweavers

91 search results - page 1 / 19
» Models For Dependable Computation with Multiple Inputs and S...
Sort
View
FUIN
2000
68views more  FUIN 2000»
13 years 4 months ago
Models For Dependable Computation with Multiple Inputs and Some Hardness Results
We consider the problem of dependable computation with multiple inputs. The goal is to study when redundancy can help to achieve survivability and when it cannot. We use AND/OR gra...
Yongge Wang, Yvo Desmedt, Mike Burmester
RANDOM
1998
Springer
13 years 9 months ago
Using Approximation Hardness to Achieve Dependable Computation
Abstract. Redundancy has been utilized to achieve fault tolerant computation and to achieve reliable communication in networks of processors. These techniques can only be extended ...
Mike Burmester, Yvo Desmedt, Yongge Wang
CORR
2012
Springer
218views Education» more  CORR 2012»
12 years 12 days ago
On the Hardness of Welfare Maximization in Combinatorial Auctions with Submodular Valuations
We present a new type of monotone submodular functions: multi-peak submodular functions. Roughly speaking, given a family of sets F, we construct a monotone submodular function f ...
Shahar Dobzinski, Jan Vondrák
JSA
2000
175views more  JSA 2000»
13 years 4 months ago
Complete worst-case execution time analysis of straight-line hard real-time programs
In this article, the problem of finding a tight estimate on the worst-case execution time (WCET) of a real-time program is addressed. The analysis is focused on straight-line code...
Friedhelm Stappert, Peter Altenbernd
ICML
2010
IEEE
13 years 5 months ago
Restricted Boltzmann Machines are Hard to Approximately Evaluate or Simulate
Restricted Boltzmann Machines (RBMs) are a type of probability model over the Boolean cube {-1, 1}n that have recently received much attention. We establish the intractability of ...
Philip M. Long, Rocco A. Servedio