WFRF:(Bohlin Markus)
Search: WFRF:(Bohlin Markus) > (2005-2009) > Best-Effort Simulat...
- 7 of 25
- Previous record
- Next record
- To hitlist
Best-Effort Simulation-Based Timing Analysis using Hill-Climbing with Random Restarts
-
- Bohlin, Markus (author)
- RISE,SICS
-
- Lu, Yue (author)
- Mälardalens högskola,Akademin för innovation, design och teknik
-
- Kraft, Johan (author)
- Mälardalens högskola,Akademin för innovation, design och teknik
- show more...
- show less...
- (creator_code:org_t)
- 6
- IEEE Computer Society, 2009
- 2009
- English.
- In: Proceedings of the 15th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications. - : IEEE Computer Society.
- Conference paper (peer-reviewed)
Subject headings
Close
Subject headings
- NATURVETENSKAP -- Data- och informationsvetenskap (hsv//swe)
- NATURAL SCIENCES -- Computer and Information Sciences (hsv//eng)
- TEKNIK OCH TEKNOLOGIER -- Elektroteknik och elektronik -- Datorsystem (hsv//swe)
- ENGINEERING AND TECHNOLOGY -- Electrical Engineering, Electronic Engineering, Information Engineering -- Computer Systems (hsv//eng)
Publication and Content Type
- ref (subject category)
- kon (subject category)
To the university's database
- 7 of 25
- Previous record
- Next record
- To hitlist
Find more in SwePub
- By the author/editor
- Bohlin, Markus
- Lu, Yue
- Kraft, Johan
- Kreuger, Per
- Nolte, Thomas
- About the subject
-
- NATURAL SCIENCES
- NATURAL SCIENCES
- and Computer and Inf ...
-
- ENGINEERING AND TECHNOLOGY
- ENGINEERING AND ...
- and Electrical Engin ...
- and Computer Systems
- Articles in the publication
- Proceedings of t ...
- By the university
- RISE
- Mälardalen University
Search outside SwePub
- Extend your search to:
- Google Book Search
- Google Scholar
Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.
- Copyright © LIBRIS - National Library Systems
- LIBRIS.kb.se
