Real time scheduling for autonomous mobile robots using genetic algorithm and constraint based reasoning
In many real-time systems, relative timing constraints are imposed on a set of tasks. Generating a correct ordering for the tasks and deriving their proper start-time assignments is a Nondeterministic Polynomial Problem (NP) hard problem; it subsumes the Non-preemptive Scheduling Problem. Real-time...
à®®à¯à®´à¯ விளகà¯à®•à®®à¯
Saved in:
| தலைமை எழà¯à®¤à¯à®¤à®¾à®³à®°à¯: | |
|---|---|
| வடிவமà¯: | Thesis |
| மொழி: | English |
| வெளியீடபà¯à®ªà®Ÿà¯à®Ÿà®¤à¯: |
2006
|
| பகà¯à®¤à®¿à®•à®³à¯: | |
| நிகழà¯à®¨à®¿à®²à¯ˆ அணà¯à®•à®²à¯: | http://eprints.utm.my/4060/ http://eprints.utm.my/4060/9/AmmarAbdoMohammedHasanMCD2006.pdf |
| கà¯à®±à®¿à®¯à¯€à®Ÿà¯à®•à®³à¯: |
கà¯à®±à®¿à®šà¯à®šà¯Šà®²à¯ இணை
கà¯à®±à®¿à®¯à¯€à®Ÿà¯à®•à®³à¯ இலà¯à®²à¯ˆ, இநà¯à®¤ கà¯à®±à®¿à®šà¯à®šà¯Šà®²à¯à®²à¯ˆ à®®à¯à®¤à®²à®¿à®²à¯ பதிவ௠செயà¯à®¯à¯à®™à¯à®•à®³à¯!
|