Sciweavers

914 search results - page 40 / 183
» The Computational Complexity of Probabilistic Planning
Sort
View
TSMC
2008
113views more  TSMC 2008»
13 years 10 months ago
Computational Methods for Verification of Stochastic Hybrid Systems
Stochastic hybrid system (SHS) models can be used to analyze and design complex embedded systems that operate in the presence of uncertainty and variability. Verification of reacha...
Xenofon D. Koutsoukos, Derek Riley
DEBS
2008
ACM
14 years 5 days ago
On static determination of temporal relevance for incremental evaluation of complex event queries
Evaluation of complex event queries over time involves storing information about those events that are relevant for, i.e., might contribute to, future answers. We call the period ...
François Bry, Michael Eckert
VR
2007
IEEE
141views Virtual Reality» more  VR 2007»
14 years 4 months ago
Real-time Path Planning for Virtual Agents in Dynamic Environments
We present a novel approach for real-time path planning of multiple virtual agents in complex dynamic scenes. We introduce a new data structure, Multi-agent Navigation Graph (MaNG...
Avneesh Sud, Erik Andersen, Sean Curtis, Ming C. L...
CONCUR
2000
Springer
14 years 2 months ago
Weak Bisimulation for Probabilistic Systems
Abstract. In this paper, we introduce weak bisimulation in the framework of Labeled Concurrent Markov Chains, that is, probabilistic transition systems which exhibit both probabili...
Anna Philippou, Insup Lee, Oleg Sokolsky
ECBS
2005
IEEE
103views Hardware» more  ECBS 2005»
14 years 4 months ago
Improving the System/Software Engineering Interface for Complex System Development
At the 2004 Engineering of Computer Based Systems (ECBS) Technical Committee meeting, the ECBS Executive Committee agreed that a guideline on Integrated System and Software Engine...
Stephanie M. White