Sciweavers

2354 search results - page 205 / 471
» Randomness, Stochasticity and Approximations
Sort
View
PODS
2012
ACM
276views Database» more  PODS 2012»
13 years 7 months ago
Randomized algorithms for tracking distributed count, frequencies, and ranks
We show that randomization can lead to significant improvements for a few fundamental problems in distributed tracking. Our basis is the count-tracking problem, where there are k...
Zengfeng Huang, Ke Yi, Qin Zhang
SIGSOFT
2007
ACM
16 years 5 months ago
Recommending random walks
We improve on previous recommender systems by taking advantage of the layered structure of software. We use a random-walk approach, mimicking the more focused behavior of a develo...
Zachary M. Saul, Vladimir Filkov, Premkumar T. Dev...
ICCD
2001
IEEE
119views Hardware» more  ICCD 2001»
16 years 1 months ago
A Functional Validation Technique: Biased-Random Simulation Guided by Observability-Based Coverage
We present a simulation-based semi-formal verification method for sequential circuits described at the registertransfer level. The method consists of an iterative loop where cove...
Serdar Tasiran, Farzan Fallah, David G. Chinnery, ...
MFCS
2005
Springer
15 years 10 months ago
Coloring Sparse Random k-Colorable Graphs in Polynomial Expected Time
Abstract. Feige and Kilian [5] showed that finding reasonable approximative solutions to the coloring problem on graphs is hard. This motivates the quest for algorithms that eithe...
Julia Böttcher
ICRA
2000
IEEE
84views Robotics» more  ICRA 2000»
15 years 9 months ago
Enhancing Randomized Motion Planners: Exploring with Haptic Hints
In this paper, we investigate methods for enabling a human operator and an automatic motion planner to cooperatively solve a motion planning query. Our work is motivated by our ex...
O. Burçhan Bayazit, Guang Song, Nancy M. Am...