## Proceedings, Volumes 1-2IEEE, 1999 - Artificial intelligence |

### From inside the book

Results 1-3 of 72

Page 308

Computing a firable

marked graph given in figure 4 . . As for state machine , we only give a dominant

set of feasible

Computing a firable

**sequence**Figure 5 gives the graph G ( N ) associated to themarked graph given in figure 4 . . As for state machine , we only give a dominant

set of feasible

**sequences**for marked graph . A classical branch and bound can ...Page 309

The previous algorithm is pseudo - polynomial , since it depends on the length of

the

Before proving that balanced

The previous algorithm is pseudo - polynomial , since it depends on the length of

the

**sequence**to build . ... According to the definition of a balanced**sequence**:Before proving that balanced

**sequences**are a set of dominant**sequences**, we ...Page 600

Let ( A , B ) be a pair of complementary

the binary elements from the set ( 0 , 1 ) which build ... If they are added bit by bit ,

an ideal autocorrelation function is obtained : A

Let ( A , B ) be a pair of complementary

**sequences**of length N , and a ; and b ;the binary elements from the set ( 0 , 1 ) which build ... If they are added bit by bit ,

an ideal autocorrelation function is obtained : A

**Sequence**: 1 - 1 B**Sequence**...### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Contents

Java RealTime Distributed Processing Over ATM Networks with ChorusOS | 3 |

Optimizing Costs and Processing Times Under Variable External Processing | 4 |

Resources 1047 | 8 |

Copyright | |

59 other sections not shown

### Other editions - View all

### Common terms and phrases

action activity adaptive agent algorithm allows analysis application approach architecture Automation behavior block communication complex components configuration connection considered consists corresponding cost decision defined depends described detected determine developed devices distributed dynamic Engineering environment error example execution Figure final flow function given implementation important improve industrial initial input integrated interface International Java learning machine manufacturing means measurement method module monitoring necessary object obstacle obtained operations optimal output parameters performance planning plant position possible presented problem proposed reference represented robot rules scheduling selected sensor sequence server shown shows signal simulation solution specific step structure Table task techniques tool transition unit variables visual