Proceedings, Volumes 1-2IEEE, 1996 - Artificial intelligence |
From inside the book
Results 1-3 of 84
Page 22
... given n jobs and for each job we have a release date , a processing time and a due date . It is assumed that certain ... given release dates is strongly NP - hard in consequence of strong NP - hardness of the problem of minimizing the ...
... given n jobs and for each job we have a release date , a processing time and a due date . It is assumed that certain ... given release dates is strongly NP - hard in consequence of strong NP - hardness of the problem of minimizing the ...
Page 304
... given at random . Here , n expresses a nth learning step . Step 2 : These neural units are ordered by the distance ( x - w ) between the given target position and each of these units : if the distance to the ith unit is shortest , then ...
... given at random . Here , n expresses a nth learning step . Step 2 : These neural units are ordered by the distance ( x - w ) between the given target position and each of these units : if the distance to the ith unit is shortest , then ...
Page 310
... given path are given in the next section . Dis- cussion on control issues and simulation examples are pre- sented in the succeeding sections . Conclusions and and fu- ture research directions are addressed in the last section . II ...
... given path are given in the next section . Dis- cussion on control issues and simulation examples are pre- sented in the succeeding sections . Conclusions and and fu- ture research directions are addressed in the last section . II ...
Contents
Intelligent HumanMachine Systems in a Modern Communication Infrastructure | 1 |
SESSION TU4AScheduling | 16 |
Rescheduling Method based on Distributed Cooperative Problem Solving Model | 35 |
Copyright | |
29 other sections not shown
Other editions - View all
Common terms and phrases
agents algorithm application approach assignment Automated Manufacturing Systems Automation behavior buffer component Computer configuration considered constraints control system cost data link layer deadlines deadlock defined device under test distributed due dates dynamic environment evaluation evolutionary algorithm example execution feature fieldbus Figure flexible frequency function Genetic Algorithm global heuristic holarchy holons IEEE implementation input integration intelligent interaction learning logical controller machine macroaction manipulator Manufacturing Systems messages method Mimetism model checking monitoring nodes object optimal output paper parameters performance Petri net Petri nets phase PID control placement planning plant priority inversion problem processor Profibus proposed protocol real-time resource robot robot cell scheduling semaphore sensor sequence server shown signal simulation solution solve specific stage station structure supervisor task techniques telerobotic Theorem tion token torque transition vector vibration