Sciweavers

5169 search results - page 179 / 1034
» Locality approximation using time
Sort
View
DAC
1994
ACM
15 years 10 months ago
Exact and Approximate Methods for Calculating Signal and Transition Probabilities in FSMs
In this paper, we consider the problem of calculating the signal and transition probabilities of the internal nodes of the combinational logic part of a nite state machine (FSM). ...
Chi-Ying Tsui, Massoud Pedram, Alvin M. Despain
TELETRAFFIC
2007
Springer
16 years 18 days ago
Performance Analysis of a Fluid Queue with Random Service Rate in Discrete Time
We consider a fluid queue in discrete time with random service rate. Such a queue has been used in several recent studies on wireless networks where the packets can be arbitrarily...
Onno J. Boxma, Vinod Sharma, D. K. Prasad
ICRA
2010
IEEE
138views Robotics» more  ICRA 2010»
15 years 5 months ago
Rao-Blackwellized particle filtering for probing-based 6-DOF localization in robotic assembly
This paper presents a probing-based method for probabilistic localization in automated robotic assembly. We consider peg-in-hole problems in which a needle-like peg has a single p...
Yuichi Taguchi, Tim K. Marks, Haruhisa Okuda
SIAMSC
2011
142views more  SIAMSC 2011»
15 years 1 months ago
Efficiency Based Adaptive Local Refinement for First-Order System Least-Squares Formulations
Abstract. In this paper, we propose new adaptive local refinement (ALR) strategies for firstorder system least-squares (FOSLS) finite element in conjunction with algebraic multi...
J. H. Adler, Thomas A. Manteuffel, Stephen F. McCo...
CJ
2010
128views more  CJ 2010»
15 years 6 months ago
A Self-Stabilizing O(k)-Time k-Clustering Algorithm
A silent self-stabilizing asynchronous distributed algorithms is given for constructing a kdominating set, and hence a k-clustering, of a connected network of processes with uniqu...
Ajoy Kumar Datta, Lawrence L. Larmore, Priyanka Ve...