Sciweavers

2990 search results - page 480 / 598
» Hidden Markov processes
Sort
View
CORR
2006
Springer
100views Education» more  CORR 2006»
15 years 6 months ago
Capacity of Cooperative Fusion in the Presence of Byzantine Sensors
Abstract-- The problem of cooperative fusion in the presence of both Byzantine sensors and misinformed sensors is considered. An information theoretic formulation is used to charac...
Oliver Kosut, Lang Tong
TCS
2008
15 years 6 months ago
The cost of offline binary search tree algorithms and the complexity of the request sequence
In evaluating the performance of online algorithms for search trees, one wants to compare them to the best offline algorithm available. In this paper we lower bound the cost of an...
Jussi Kujala, Tapio Elomaa
IOR
2007
82views more  IOR 2007»
15 years 6 months ago
Compensating for Failures with Flexible Servers
We consider the problem of maximizing capacity in a queueing network with flexible servers, where the classes and servers are subject to failure. We assume that the interarrival ...
Sigrún Andradóttir, Hayriye Ayhan, D...
JSAC
2007
73views more  JSAC 2007»
15 years 6 months ago
Optimal Wavelength Sharing Policies in OBS Networks Subject to QoS Constraints
— We consider the general problem of optimizing the performance of OBS networks with multiple traffic classes subject to strict (absolute) QoS constraints in terms of the end-to...
Li Yang, George N. Rouskas
ENTCS
2002
139views more  ENTCS 2002»
15 years 6 months ago
Automatic Verification of the IEEE-1394 Root Contention Protocol with KRONOS and PRISM
We report on the automatic verification of timed probabilistic properties of the IEEE 1394 root contention protocol combining two existing tools: the real-time modelchecker Kronos...
Conrado Daws, Marta Z. Kwiatkowska, Gethin Norman