Sciweavers

697 search results - page 53 / 140
» On Composable System Timing, Task Timing, and WCET Analysis
Sort
View
SC
2009
ACM
16 years 23 days ago
Dynamic task scheduling for linear algebra algorithms on distributed-memory multicore systems
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...
Fengguang Song, Asim YarKhan, Jack Dongarra
KBSE
2009
IEEE
16 years 21 days ago
Automatically Recommending Triage Decisions for Pragmatic Reuse Tasks
—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...
Reid Holmes, Tristan Ratchford, Martin P. Robillar...
CICLING
2003
Springer
15 years 11 months ago
Natural Language in Information Retrieval
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...
Elzbieta Dura
ISOLA
2010
Springer
15 years 4 months ago
Worst-Case Analysis of Heap Allocations
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...
Wolfgang Puffitsch, Benedikt Huber, Martin Schoebe...
ICRA
2007
IEEE
175views Robotics» more  ICRA 2007»
16 years 8 days ago
Visual Servoing in Non-Rigid Environments: A Space-Time Approach
— 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...
D. Santosh, C. V. Jawahar