Sciweavers

282 search results - page 1 / 57
» Probabilistic Timed Behavior Trees
Sort
View
IFM
2007
Springer
104views Formal Methods» more  IFM 2007»
13 years 11 months ago
Probabilistic Timed Behavior Trees
The Behavior Tree notation has been developed as a method for systematically and traceably capturing user requirements. In this paper we extend the notation with probabilistic beha...
Robert Colvin, Lars Grunske, Kirsten Winter
PODC
1989
ACM
13 years 9 months ago
Multiple Communication in Multi-Hop Radio Networks
Two tasks of communication in a multi-hop synchronous radio network are considered: point-to-point communication and broadcast (sending a message to all nodes of a network). Effi...
Reuven Bar-Yehuda, Amos Israeli
ASWEC
2007
IEEE
13 years 11 months ago
Timed Behavior Trees and Their Application to Verifying Real-Time Systems
Behavior Trees (BTs) are a graphical notation used for formalising functional requirements and have been successfully applied to several case studies. However, the notation curren...
Lars Grunske, Kirsten Winter, Robert Colvin
ECML
2007
Springer
13 years 8 months ago
Modeling Highway Traffic Volumes
Most traffic management and optimization tasks, such as accident detection or optimal vehicle routing, require an ability to adequately model, reason about and predict irregular an...
Tomás Singliar, Milos Hauskrecht
SIGMOD
2011
ACM
249views Database» more  SIGMOD 2011»
12 years 7 months ago
ProApproX: a lightweight approximation query processor over probabilistic trees
We demonstrate a system for querying probabilistic XML documents with simple XPath queries. A user chooses between a variety of query answering techniques, both exact and approxim...
Pierre Senellart, Asma Souihli