3934 search results - page 273 / 787 » Approximate Schedulability Analysis |
216
click to vote
TMC
2011
15 years 1 months ago
2011
—Mission-driven sensor networks usually have special lifetime requirements. However, the density of the sensors may not be large enough to satisfy the coverage requirement while ...
153
click to vote
ATAL
2008
Springer
15 years 8 months ago
2008
Springer
In many complex multi-agent domains it is impractical to compute exact analytic solutions. An alternate means of analysis applies computational tools to derive and analyze empiric...
157
click to vote
MOC
1998
15 years 6 months ago
1998
Third-order numerical methods are analyzed for secular equations. These equations arise in several matrix problems and numerical linear algebra applications. A closer look at an ex...
183
click to vote
COORDINATION
2009
Springer
16 years 7 months ago
2009
Springer
Process-oriented programming is a design methodology in which software applications are constructed from communicating concurrent processes. A process-oriented design is typically ...
169
click to vote
SC
2009
ACM
16 years 1 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...