5015 search results - page 383 / 1003 » Model Checking a Path |
181
click to vote
ICDCSW
2005
IEEE
16 years 9 days ago
2005
IEEE
Recent researches have highlighted the importance of developing a network with distributed problem solving abilities thus enhancing reliability with equal share of network resourc...
181
click to vote
RT
2001
Springer
15 years 11 months ago
2001
Springer
We introduce hybrid rendering, a scheme that dynamically ray traces the local geometry of reflective and refractive objects, but approximates more distant geometry by hardwaresupp...
184
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
We study the worst-case communication complexity of distributed algorithms computing a path problem based on stationary distributions of random walks in a network G with the caveat...
162
click to vote
TIT
2008
15 years 6 months ago
2008
Abstract--This letter considers the average complexity of maximum-likelihood (ML) decoding of convolutional codes. ML decoding can be modeled as finding the most probable path take...
180
click to vote
AROBOTS
2002
15 years 6 months ago
2002
We present an approach to path planning for humanoid robots that computes dynamically-stable, collision-free trajectories from full-body posture goals. Given a geometric model of t...