๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Configuration Reusing in On-Line Task Scheduling for Reconfigurable Computing Systems

โœ Scribed by Maisam Mansub Bassiri; Hadi Shahriar Shahhoseini

Publisher
Springer
Year
2011
Tongue
English
Weight
494 KB
Volume
26
Category
Article
ISSN
1000-9000

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

On Dense Bipartite Graphs of Girth Eight
On Dense Bipartite Graphs of Girth Eight and Upper Bounds for Certain Configurations in Planar Pointโ€“Line Systems
โœ D de Caen; L.A Szรฉkely ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 956 KB

In earlier work we showed that if G(m, n) is a bipartite graph with no 4-cycles or 6-cycles, and if m<c 1 n 2 and n<c 2 m 2 , then the number of edges e is O((mn) 2ร‚3 ). Here we give a more streamlined proof, obtaining some sharp results; for example, if G has minimum degree at least two then e 3 -

Interface requirements, transducers and
Interface requirements, transducers and computers for on-line systems: Survey on digital computers in control fourth congressโ€”International federation of automatic control Warsaw, Polandโ€”June 16โ€“20, 1969
โœ T.J. Williams ๐Ÿ“‚ Article ๐Ÿ“… 1969 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 929 KB

Exigences vis h vis des matdriels p6riph6riques, des capteurs et des calculateurs pour les syst~mes de rdglage StoBstellenanforderungen, Wandler und Rechner far on-line-Systeme Tpe6oBaH14n rtpezi~B.naeMble r nepx, Iqbepx,lqeCroMy o6opy/IoBaHmo, r )IaTqnKaM 14 K BblHI4CMPITeMbHbIM yCTpOfiCTBaM )I.rI~