Sciweavers

1722 search results - page 239 / 345
» On the sample mean of graphs
Sort
View
ICRA
2000
IEEE
117views Robotics» more  ICRA 2000»
15 years 10 months ago
Kinodynamic Motion Planning Amidst Moving Obstacles
This paper presents a randomized motion planner for kinodynamic asteroidavoidanceproblems, in which a robot must avoid collision with moving obstacles under kinematic, dynamic con...
Robert Kindel, David Hsu, Jean-Claude Latombe, Ste...
IWSSD
2000
IEEE
15 years 10 months ago
Specification, Safety and Reliability Analysis Using Stochastic Petri Net Models
In this study we focus on the specification and assessment of Stochastic Petri net (SPN) models to evaluate the design of an embedded system for reliability and availability. The ...
Frederick T. Sheldon, Stefan Greiner, Matthias Ben...
RSP
1999
IEEE
125views Control Systems» more  RSP 1999»
15 years 10 months ago
Extended Synchronous Dataflow for Efficient DSP System Prototyping
Though synchronous dataflow (SDF) graph has been a successful input specification language for digital signal processing (DSP) applications, lack of support for global states makes...
Chanik Park, JaeWoong Chung, Soonhoi Ha
SP
1998
IEEE
116views Security Privacy» more  SP 1998»
15 years 10 months ago
Strand Spaces: Why is a Security Protocol Correct?
A strand is a sequence of events; it represents either the execution of legitimate party in a security protocol or else a sequence of actions by a penetrator. A strand space is a ...
F. Javier Thayer, Jonathan C. Herzog, Joshua D. Gu...
LATIN
1998
Springer
15 years 10 months ago
Short and Smooth Polygonal Paths
Abstract. Automatic graph drawers need to compute paths among vertices of a simple polygon which besides remaining in the interior need to exhibit certain aesthetic properties. Som...
James Abello, Emden R. Gansner