9842 search results - page 1476 / 1969 » Compositional timing analysis |
214
click to vote
ICRA
2002
IEEE
15 years 12 months ago
2002
IEEE
:This paper presents a trajectory planning algorithm for mobile robots which may be subject to kinodynamic constraints. Using computational methods from noncommutative harmonic ana...
218
click to vote
STOC
2010
ACM
15 years 12 months ago
2010
ACM
The Steiner tree problem is one of the most fundamental ÆÈ-hard problems: given a weighted undirected graph and a subset of terminal nodes, find a minimum weight tree spanning ...
183
click to vote
CCS
2001
ACM
15 years 11 months ago
2001
ACM
Authenticating mobile computing users can require a significant amount of processing and communications resources— particularly when protocols based on public key encryption are...
157
click to vote
MFCS
2001
Springer
15 years 11 months ago
2001
Springer
In the traveling repairman problem (Trp), a tour must be found through every one of a set of points (cities) in some metric space such that the weighted sum of completion times of ...
183
click to vote
RTCSA
2000
IEEE
15 years 11 months ago
2000
IEEE
A number of industrial applications advocate the use of time-triggered approaches for reasons of predictability, distribution, and particular constraints such as jitter or end-to-...