Sciweavers

3885 search results - page 420 / 777
» Clarifying Goal Models
Sort
View
COMPSAC
2005
IEEE
16 years 11 days ago
Designing Controllers for Reachability
We propose a deductive method for constructing reliable reachability controllers, with application to fault-tolerant discrete systems. Designing the controller reduces to finding...
Cristina Cerschi Seceleanu
HICSS
2005
IEEE
148views Biometrics» more  HICSS 2005»
16 years 10 days ago
Public-Key-Infrastructure Based on a Peer-to-Peer Network
The goal of a Public-Key-Infrastructure (PKI) is to prove whether a cryptographic public key is authentic for a certain user. This information is crucial for the reliability of as...
Thomas Wölfl
IAT
2005
IEEE
16 years 10 days ago
Conversation Pattern-based Anticipation of Teammates' Information Needs via Overhearing
One research focus of human-centered teamwork is on advanced decision architectures that can help people make effective and timely decisions. This requires distributed team member...
Xiaocong Fan, John Yen
ICMCS
2005
IEEE
128views Multimedia» more  ICMCS 2005»
16 years 10 days ago
Low-complexity automatic speaker recognition in the compressed GSM AMR domain
This paper presents an experimental implementation of a low-complexity speaker recognition algorithm working in the compressed speech domain. The goal is to perform speaker modeli...
Matteo Petracca, Antonio Servetti, Juan Carlos De ...
ICRA
2005
IEEE
115views Robotics» more  ICRA 2005»
16 years 10 days ago
An Interpolated Dynamic Navigation Function
— The E∗ algorithm is a path planning method capable of dynamic replanning and user-configurable path cost interpolation. It calculates a navigation function as a sampling of ...
Roland Philippsen, Roland Siegwart