TDMA Time Slot and Turn Optimization with Evolutionary Search Techniques
In this paper we present arithmetic real-coded variation operators tailored for time slot and turn optimization on TDMA-scheduled resources with evolutionary algorithms. Our operators implement a heuristic strategy to converge towards the solution space and are able to escape local minima. Furthermo...
Uloženo v:
| Vydáno v: | Design, Automation and Test in Europe s. 312 - 317 |
|---|---|
| Hlavní autoři: | , |
| Médium: | Konferenční příspěvek |
| Jazyk: | angličtina |
| Vydáno: |
Washington, DC, USA
IEEE Computer Society
07.03.2005
IEEE |
| Edice: | ACM Conferences |
| Témata: |
Computing methodologies
> Artificial intelligence
> Search methodologies
> Heuristic function construction
Theory of computation
> Design and analysis of algorithms
> Approximation algorithms analysis
> Scheduling algorithms
Theory of computation
> Design and analysis of algorithms
> Data structures design and analysis
> Sorting and searching
Theory of computation
> Design and analysis of algorithms
> Online algorithms
> Online learning algorithms
> Scheduling algorithms
|
| ISBN: | 9780769522883, 0769522882 |
| ISSN: | 1530-1591 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
Buďte první, kdo okomentuje tento záznam!

