ProceedingsIEEE, 1997 - Artificial intelligence |
From inside the book
Results 1-3 of 21
Page 180
The active objects ( agents ) achieved decision - making process . For operation
op26a , there is no other sequence that contains it . Therefore it is sufficient to
calculate d ( G1 , G2 ) and d ( G3 , G2 ) . We obtain : d ( G1 , G2 ) = 0 . 25 d ( G3 ,
G2 ) ...
The active objects ( agents ) achieved decision - making process . For operation
op26a , there is no other sequence that contains it . Therefore it is sufficient to
calculate d ( G1 , G2 ) and d ( G3 , G2 ) . We obtain : d ( G1 , G2 ) = 0 . 25 d ( G3 ,
G2 ) ...
Page 356
For every network the state of every input node ( feature ) as being active or
removed was maintained in a vector of size n , with 1 specifying that the
respective node is active and 0 that the respective node is removed . To maintain
the ...
For every network the state of every input node ( feature ) as being active or
removed was maintained in a vector of size n , with 1 specifying that the
respective node is active and 0 that the respective node is removed . To maintain
the ...
Page 474
The simultaneous sequence divergence is decipted by a pair of parallel
horizontal lines in Fig . 3 . Multiple steps are simultaneously activated by firing
one transition . When all last steps for simultaneous sequences are active , the
following ...
The simultaneous sequence divergence is decipted by a pair of parallel
horizontal lines in Fig . 3 . Multiple steps are simultaneously activated by firing
one transition . When all last steps for simultaneous sequences are active , the
following ...
What people are saying - Write a review
We haven't found any reviews in the usual places.
Contents
Mitchell M Tseng The Hong Kong Univ of CoChair Wolfgang Kuechlin Universitat Tubingen | 7 |
des Sciences Application de Lyon ModelMixed Engine Dispatching | 19 |
Carbondale for Induction Motors | 45 |
Copyright | |
41 other sections not shown
Other editions - View all
Common terms and phrases
according activities algorithm allows analysis application approach assembly Automation called communication complex components considered constraints control system cost customers deadlock decision defined demand described determined direction disassembly distributed dynamic effective Engineering enterprise environment equipment estimated evaluation example existing Figure fixture flexible flow function given implementation important improvement increase industrial input integrated interaction interface knowledge lead learning load locating machine manuals manufacturing means measure method moved object obtained operation optimal parameters performance planning plant position possible presented problem proposed provides real-time reference represents robot scheduling selected sequence server shown shows simulation solution specific standard station structure task tool unit University virtual weight