Sciweavers

2584 search results - page 69 / 517
» On the Forward Checking Algorithm
Sort
View
STOC
1998
ACM
135views Algorithms» more  STOC 1998»
14 years 5 days ago
Checking Polynomial Identities over any Field: Towards a Derandomization?
We present a Monte Carlo algorithm for testing multivariate polynomial identities over any field using fewer random bits than other methods. To test if a polynomial P(x1 ::: xn) ...
Daniel Lewin, Salil P. Vadhan
CORR
2008
Springer
106views Education» more  CORR 2008»
13 years 8 months ago
Construction of Near-Optimum Burst Erasure Correcting Low-Density Parity-Check Codes
In this paper, a simple and effective tool for the design of low-density parity-check (LDPC) codes for iterative correction of bursts of erasures is presented. The design method co...
Enrico Paolini, Marco Chiani
ICC
2007
IEEE
126views Communications» more  ICC 2007»
14 years 2 months ago
Probabilistic Search in P2P Networks with High Node Degree Variation
— A novel Adaptive Resource-based Probabilistic Search algorithm (ARPS) for P2P networks is proposed in this paper. ARPS introduces weighted probabilistic forwarding for query me...
Haoxiang Zhang, Lin Zhang, Xiuming Shan, Victor O....
GRIDNETS
2008
13 years 9 months ago
Hop Optimization and Relay Node Selection in Multi-hop Wireless Ad-Hoc Networks
In this paper we propose an efficient approach to determine the optimal hops for multi-hop ad hoc wireless networks. Based on the assumption that nodes use successive interferenc...
Xiaohua Li
CAV
2005
Springer
173views Hardware» more  CAV 2005»
14 years 1 months ago
Building Your Own Software Model Checker Using the Bogor Extensible Model Checking Framework
Model checking has proven to be an effective technology for verification and debugging in hardware and more recently in software domains. We believe that recent trends in both th...
Matthew B. Dwyer, John Hatcliff, Matthew Hoosier, ...