Sciweavers

575 search results - page 86 / 115
» Model Checking Restricted Sets of Timed Paths
Sort
View
IPPS
1997
IEEE
15 years 4 months ago
Nearly Optimal One-To-Many Parallel Routing in Star Networks
Star networks were proposedrecently as an attractive alternative to the well-known hypercube models for interconnection networks. Extensive research has been performed that shows ...
Chi-Chang Chen, Jianer Chen
LOGCOM
2007
115views more  LOGCOM 2007»
14 years 11 months ago
The Dynamics of Syntactic Knowledge
The syntactic approach to epistemic logic avoids the logical omniscience problem by taking knowledge as primary rather than as defined in terms of possible worlds. In this study, ...
Thomas Ågotnes, Natasha Alechina
WACV
2005
IEEE
15 years 5 months ago
Simultaneous Localization and Recognition of Dynamic Hand Gestures
A method for the simultaneous localization and recognition of dynamic hand gestures is proposed. At the core of this method is a dynamic space-time warping (DSTW) algorithm, that ...
Jonathan Alon, Vassilis Athitsos, Quan Yuan, Stan ...
GLOBECOM
2010
IEEE
14 years 10 months ago
Column Generation for Dimensioning Resilient Optical Grid Networks with Relocation
Nowadays, the Quality of Service (QoS) in Optical Grids has become a key issue. An important QoS factor is the resiliency, namely the ability to survive from certain network failur...
Brigitte Jaumard, Jens Buysse, Ali Shaikh, Marc De...
CIE
2010
Springer
15 years 3 months ago
How Powerful Are Integer-Valued Martingales?
In the theory of algorithmic randomness, one of the central notions is that of computable randomness. An infinite binary sequence X is computably random if no recursive martingale...
Laurent Bienvenu, Frank Stephan, Jason Teutsch