Cargando…
Discrete event systems in dioid algebra and conventional algebra
This book concerns the use of dioid algebra as (max, +) algebra to treat the synchronization of tasks expressed by the maximum of the ends of the tasks conditioning the beginning of another task - a criterion of linear programming. A classical example is the departure time of a train which should wa...
Autor principal: | Declerck, Philippe |
---|---|
Lenguaje: | eng |
Publicado: |
Wiley
2013
|
Materias: | |
Acceso en línea: | http://cds.cern.ch/record/1616908 |
Ejemplares similares
-
Graphs, dioids and semirings: new models and algorithms
por: Gondran, Michel, et al.
Publicado: (2008) -
Fundamental structures of algebra and discrete mathematics
por: Foldes, Stephan
Publicado: (2011) -
Applied algebra: codes, ciphers, and discrete algorithms
por: Hardy, Darel W, et al.
Publicado: (2002) -
Algebraically approximate and noisy realization of discrete-time systems and digital images
por: Hasegawa, Yasumichi
Publicado: (2009) -
Classification of actions of discrete Kac algebras on injective factors
por: Masuda, Toshihiko, et al.
Publicado: (2017)