Sciweavers

6279 search results - page 1072 / 1256
» Studies in Solution Sampling
Sort
View
AI
2000
Springer
15 years 4 months ago
Credal networks
Credal networks are models that extend Bayesian nets to deal with imprecision in probability, and can actually be regarded as sets of Bayesian nets. Evidence suggests that credal ...
Fabio Gagliardi Cozman
COMCOM
2002
126views more  COMCOM 2002»
15 years 4 months ago
Performance analysis of wireless ATM/AAL2 over a burst error channel
Recent growth in cellular networks has motivated research on broadband access technologies for the support of diverse services over wireless networks. Wireless Asynchronous Transf...
Luis Villasenor-Gonzalez, Sophia Tsakiridou, Luis ...
CORR
2002
Springer
123views Education» more  CORR 2002»
15 years 4 months ago
Survey propagation: an algorithm for satisfiability
: We study the satisfiability of randomly generated formulas formed by M clauses of exactly K literals over N Boolean variables. For a given value of N the problem is known to be m...
Alfredo Braunstein, Marc Mézard, Riccardo Z...
FUIN
2000
68views more  FUIN 2000»
15 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
JGAA
2000
179views more  JGAA 2000»
15 years 4 months ago
Approximation Algorithms for Some Graph Partitioning Problems
This paper considers problems of the following type: given an edgeweighted k-colored input graph with maximum color class size c, find a minimum or maximum c-way cut such that eac...
George He, Jiping Liu, Cheng Zhao
« Prev « First page 1072 / 1256 Last » Next »