Titel

Merkliste
1 Ergebnisse

Exact scheduling strategies based on bipartite graph matchi..:

, In: Proceedings of the 1995 European conference on Design and Test,

Timmer, A. H. ; Jess, J. A. G. - p. 42 ff. , 1995

Link: https://dl.acm.org/doi/10.5555/787258.787416

RT 
T1 <cTitle>Proceedings of the 1995 European conference on Design and Test</cTitle>: T1 <Title>Exact scheduling strategies based on bipartite graph matching</Title>

UL https://suche.suub.uni-bremen.de/peid=acm-787416&Exemplar=1&LAN=DE
				
A1 Timmer, A. H.
A1 Jess, J. A. G.
PB IEEE Computer Society
YR 1995
K1 VLSI
K1 bipartite graph matching
K1 bottleneck identification
K1 branch-and-bound scheduler
K1 data flow graphs
K1 exact scheduling strategies
K1 high level synthesis
K1 high-level synthesis
K1 linear time
K1 problem formulation
K1 run time efficient exact scheduler
K1 scheduling
K1 search space
K1 Theory of computation
K1 Design and analysis of algorithms
K1 Approximation algorithms analysis
K1 Scheduling algorithms
K1 Online algorithms
K1 Online learning algorithms
K1 Theory and algorithms for application domains
K1 Machine learning theory
K1 Reinforcement learning
K1 Sequential decision making
SP 42 ff.
LK http://dx.doi.org/https://dl.acm.org/doi/10.5555/787258.787416
DO https://dl.acm.org/doi/10.5555/787258.787416
SF ELIB - SuUB Bremen

Export

RefWorks (nur Desktop-Version!)
Flow (Zuerst in Flow einloggen, dann importieren)