Sciweavers

1806 search results - page 185 / 362
» Randomness and halting probabilities
Sort
View
134
Voted
CIBCB
2006
IEEE
15 years 9 months ago
A Stochastic model to estimate the time taken for Protein-Ligand Docking
Abstract— Quantum mechanics and molecular dynamic simulation provide important insights into structural configurations and molecular interaction data today. To extend this atomi...
Preetam Ghosh, Samik Ghosh, Kalyan Basu, Sajal K. ...
136
Voted
WIOPT
2006
IEEE
15 years 9 months ago
Capacity optimizing hop distance in a mobile ad hoc network with power control
Abstract— In a dense multi-hop network of mobile nodes capable of applying adaptive power control, we consider the problem of finding the optimal hop distance that maximizes a c...
Dinesh Kumar 0002, Venkatesh Ramaiyan, Anurag Kuma...
GLVLSI
2005
IEEE
118views VLSI» more  GLVLSI 2005»
15 years 9 months ago
High-diagnosability online built-in self-test of FPGAs via iterative bootstrapping
We develop a novel on-line built-in self-test (BIST) technique for testing FPGAs that has a very high diagnosability even in presence of clustered faults, a fault pattern for whic...
Vishal Suthar, Shantanu Dutt
119
Voted
TACAS
2005
Springer
98views Algorithms» more  TACAS 2005»
15 years 9 months ago
Monte Carlo Model Checking
We present MC2 , what we believe to be the first randomized, Monte Carlo algorithm for temporal-logic model checking, the classical problem of deciding whether or not a property s...
Radu Grosu, Scott A. Smolka
113
Voted
FOCS
1998
IEEE
15 years 8 months ago
The Shortest Vector in a Lattice is Hard to Approximate to Within Some Constant
We show that approximating the shortest vector problem (in any p norm) to within any constant factor less than p 2 is hard for NP under reverse unfaithful random reductions with i...
Daniele Micciancio