Pages that link to "Item:Q642653"
From MaRDI portal
The following pages link to String execution time for finite languages: max is easy, min is hard (Q642653):
Displaying 5 items.
- Model approximation for batch flow shop scheduling with fixed batch sizes (Q896496) (← links)
- Analysis and control of max-plus linear discrete-event systems: an introduction (Q2177779) (← links)
- New representations for (max,+) automata with applications to performance evaluation and control of discrete event systems (Q2348373) (← links)
- Control protocol synthesis for multi-agent systems with similar actions instantiated from agent and requirement templates (Q2409354) (← links)
- A Weighted Pair Graph Representation for Reconstructibility of Boolean Control Networks (Q2833528) (← links)
