Sciweavers

9325 search results - page 1492 / 1865
» The decentralized implementability problem
Sort
View
ALMOB
2006
80views more  ALMOB 2006»
15 years 5 months ago
Effective p-value computations using Finite Markov Chain Imbedding (FMCI): application to local score and to pattern statistics
The technique of Finite Markov Chain Imbedding (FMCI) is a classical approach to complex combinatorial problems related to sequences. In order to get efficient algorithms, it is k...
Grégory Nuel
ESWA
2008
124views more  ESWA 2008»
15 years 5 months ago
An expert system for dynamic re-coordination of distributed workflows
A persistent problem in the use of automated workflow management systems for inter-organizational workflows has been the need for manual redefinition of coordination points in the...
William L. Kuechler Jr., Vijay K. Vaishnavi
AUTOMATICA
2006
132views more  AUTOMATICA 2006»
15 years 5 months ago
A new autocovariance least-squares method for estimating noise covariances
Industrial implementation of model-based control methods, such as model predictive control, is often complicated by the lack of knowledge about the disturbances entering the syste...
Brian J. Odelson, Murali R. Rajamani, James B. Raw...
FAC
2008
100views more  FAC 2008»
15 years 5 months ago
Slicing communicating automata specifications: polynomial algorithms for model reduction
Abstract. Slicing is a program analysis technique that was originally introduced to improve program debugging and understanding. The purpose of a slicing algorithm is to remove the...
Sébastien Labbé, Jean-Pierre Gallois
FGCS
2008
127views more  FGCS 2008»
15 years 5 months ago
Monte Carlo methods for matrix computations on the grid
Many scientific and engineering applications involve inverting large matrices or solving systems of linear algebraic equations. Solving these problems with proven algorithms for d...
Simon Branford, Cihan Sahin, Ashish Thandavan, Chr...
« Prev « First page 1492 / 1865 Last » Next »