697 search results - page 53 / 140 » On Composable System Timing, Task Timing, and WCET Analysis |
104
Voted
SC
2009
ACM
15 years 7 months ago
2009
ACM
This paper presents a dynamic task scheduling approach to executing dense linear algebra algorithms on multicore systems (either shared-memory or distributed-memory). We use a tas...
92
Voted
KBSE
2009
IEEE
15 years 7 months ago
2009
IEEE
—Planning a complex software modification task imposes a high cognitive burden on developers, who must juggle navigating the software, understanding what they see with respect t...
93
Voted
CICLING
2003
Springer
15 years 5 months ago
2003
Springer
It seems the time is ripe for the two to meet: NLP has grown out of prototypes and IR is having hard time trying to improve precision. Two examples of possible approaches are consi...
100
Voted
ISOLA
2010
Springer
14 years 11 months ago
2010
Springer
In object oriented languages, dynamic memory allocation is a fundamental concept. When using such a language in hard real-time systems, it becomes important to bound both the worst...
106
click to vote
ICRA
2007
IEEE
15 years 7 months ago
2007
IEEE
— Most robotic vision algorithms are proposed by envisaging robots operating in structured environments where the world is assumed to be rigid. These algorithms fail to provide o...