6251 search results - page 833 / 1251 » Randomness, Computability, and Density |
199
click to vote
IBERAMIA
2004
Springer
16 years 1 months ago
2004
Springer
Abstract. In constraint satisfaction, a general rule is to tackle the hardest part of a search problem first. In this paper, we introduce a parameter (τ) that measures the constr...
195
click to vote
ISOLA
2004
Springer
16 years 1 months ago
2004
Springer
Abstract. This paper presents a formal analysis of the device discovery phase of the Bluetooth wireless communication protocol. The performance of this process is the result of a c...
180
click to vote
PKC
2004
Springer
16 years 1 months ago
2004
Springer
Abstract. In this paper, we examine issues related to the construction of identity-based threshold decryption schemes and argue that it is important in practice to design an identi...
199
click to vote
DFT
2003
IEEE
16 years 1 months ago
2003
IEEE
Transient faults in VLSI circuits could lead to disastrous consequences. With technology scaling, circuits are becoming increasingly vulnerable to transient faults. This papers pr...
194
click to vote
ISCAS
2003
IEEE
16 years 29 days ago
2003
IEEE
The Hamiltonian Cycle (HC) problem is an important graph problem with many applications. The general backtracking algorithm normally used for random graphs often takes far too lon...