Sciweavers

93 search results - page 11 / 19
» Timed Unfoldings for Networks of Timed Automata
Sort
View
105
Voted
CN
2010
183views more  CN 2010»
14 years 11 months ago
A learning automata based scheduling solution to the dynamic point coverage problem in wireless sensor networks
The dynamic point coverage problem in wireless sensor networks is to detect some moving target points in the area of the network using as little sensor nodes as possible. One way ...
Mehdi Esnaashari, Mohammad Reza Meybodi
117
Voted
FORMATS
2006
Springer
15 years 3 months ago
Adding Invariants to Event Zone Automata
Recently, a new approach to the symbolic model checking of timed automata based on a partial order semantics was introduced, which relies on event zones that use vectors of event o...
Peter Niebert, Hongyang Qu
PERCOM
2010
ACM
14 years 10 months ago
Service-based development of mobile real-time collaboration applications for Social Networks
—Social Networks will unfold their full potential when connected people are enabled to collaborate - any time, appropriate to the current location, activity and computing environ...
Daniel Schuster, Thomas Springer, Alexander Schill
149
Voted
CVPR
2009
IEEE
1385views Computer Vision» more  CVPR 2009»
16 years 6 months ago
Distributed Multi-Target Tracking In A Self-Configuring Camera Network
This paper deals with the problem of tracking multiple targets in a distributed network of self-configuring pan-tilt-zoom cameras. We focus on applications where events unfold over...
Amit K. Roy Chowdhury, Bi Song, Cristian Soto
79
Voted
DFT
2006
IEEE
122views VLSI» more  DFT 2006»
15 years 3 months ago
Efficient and Robust Delay-Insensitive QCA (Quantum-Dot Cellular Automata) Design
The concept of clocking for QCA, referred to as the four-phase clocking, is widely used. However, inherited characteristics of QCA, such as the way to hold state, the way to synch...
Minsu Choi, Myungsu Choi, Zachary D. Patitz, Nohpi...