Maximal strips data structure to represent free space on partially reconfigurable FPGAs (Q3399241): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1080/17445760902720081 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2046283961 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2747613 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for the largest rectangle problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mining for empty spaces in large data sets. / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the maximum empty rectangle problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new algorithm for the largest empty rectangle problem / rank
 
Normal rank

Latest revision as of 23:45, 1 July 2024

scientific article
Language Label Description Also known as
English
Maximal strips data structure to represent free space on partially reconfigurable FPGAs
scientific article

    Statements

    Maximal strips data structure to represent free space on partially reconfigurable FPGAs (English)
    0 references
    0 references
    0 references
    29 September 2009
    0 references
    online scheduling
    0 references
    real time
    0 references
    reconfigurable architecture
    0 references
    task placement
    0 references
    free space data structure
    0 references

    Identifiers