Sciweavers

4539 search results - page 406 / 908
» Approaches to Compute Workflow Complexity
Sort
View
AUTOMATICA
2010
110views more  AUTOMATICA 2010»
15 years 7 months ago
Moving-horizon partition-based state estimation of large-scale systems
This paper presents three novel Moving Horizon Estimation (MHE) methods for discrete-time partitioned linear systems, i.e. systems decomposed into coupled subsystems with non-over...
Marcello Farina, Giancarlo Ferrari-Trecate, Riccar...
CORR
2010
Springer
144views Education» more  CORR 2010»
15 years 6 months ago
Stochastic Games for Security in Networks with Interdependent Nodes
This paper studies a stochastic game theoretic approach to security and intrusion detection in communication and computer networks. Specifically, an Attacker and a Defender take pa...
Kien C. Nguyen, Tansu Alpcan, Tamer Basar
CORR
2010
Springer
146views Education» more  CORR 2010»
15 years 6 months ago
Modified Bully Algorithm using Election Commission
-- Electing leader is a vital issue not only in distributed computing but also in communication network [1, 2, 3, 4, 5], centralized mutual exclusion algorithm [6, 7], centralized ...
Muhammad Mahbubur Rahman, Afroza Nahar
DEDS
2006
119views more  DEDS 2006»
15 years 6 months ago
Diagnosability of Discrete Event Systems with Modular Structure
The diagnosis of unobservable faults in large and complex discrete event systems modeled by parallel composition of automata is considered. A modular approach is developed for diag...
Olivier Contant, Stéphane Lafortune, Demost...
IJCV
2008
241views more  IJCV 2008»
15 years 6 months ago
Object Class Recognition and Localization Using Sparse Features with Limited Receptive Fields
We investigate the role of sparsity and localized features in a biologically-inspired model of visual object classification. As in the model of Serre, Wolf, and Poggio, we first a...
Jim Mutch, David G. Lowe