Sciweavers

3318 search results - page 55 / 664
» The Weak Instance Model
Sort
View
SAGA
2007
Springer
14 years 2 months ago
On Computation and Communication with Small Bias
We present two results for computational models that allow error probabilities close to 1/2. First, most computational complexity classes have an analogous class in communication ...
Harry Buhrman
SAINT
2005
IEEE
14 years 1 months ago
SOFAnet: Middleware for Software Distribution over Internet
The paper focuses on software distribution over the Internet, points to weaknesses of the current practice and argues for removing the weaknesses by introducing a ubiquitous distr...
Ladislav Sobr, Petr Tuma
CORR
2010
Springer
58views Education» more  CORR 2010»
13 years 8 months ago
On two variations of identifying codes
Identifying codes have been introduced in 1998 to model fault-detection in multiprocessor systems. In this paper, we introduce two variations of identifying codes: weak codes and ...
Olivier Delmas, Sylvain Gravier, Mickaël Mont...
CP
2004
Springer
14 years 1 months ago
Understanding Random SAT: Beyond the Clauses-to-Variables Ratio
It is well known that the ratio of the number of clauses to the number of variables in a random k-SAT instance is highly correlated with the instance’s empirical hardness. We con...
Eugene Nudelman, Kevin Leyton-Brown, Holger H. Hoo...
ER
2007
Springer
105views Database» more  ER 2007»
14 years 2 months ago
Clarifying Goal Models
Representation and reasoning about information system (IS) requirements is facilitated with the use of goal models to describe the desired and undesired IS behaviors. One difficul...
Ivan Jureta, Stéphane Faulkner