904 search results - page 135 / 181 » Scheduling task graphs optimally with A |
157
click to vote
MP
2010
14 years 11 months ago
2010
In many practical applications, the task is to optimize a non-linear objective function over the vertices of a well-studied polytope as, e.g., the matching polytope or the travelli...
146
click to vote
ICW
2005
IEEE
15 years 10 months ago
2005
IEEE
Large-scale networks of mobile agents autonomously performing long-term sensing and communication tasks will be foreseeable in the near future. Since nodes in such a system commun...
123
Voted
ICCD
2007
IEEE
15 years 8 months ago
2007
IEEE
While Speculative Multithreading (SM) on a Chip Multiprocessor (CMP) has the ability to speed-up hard-toparallelize applications, the power inefficiency of aggressive speculation ...
157
click to vote
EMSOFT
2010
Springer
15 years 2 months ago
2010
Springer
We propose the first polynomial-time code selection algorithm for minimising the worst-case execution time of a nonnested loop executed on a fully pipelined processor that uses sc...
177
click to vote
PR
2010
15 years 3 months ago
2010
Locality preserving projections (LPP) is a typical graph-based dimensionality reduction (DR) method, and has been successfully applied in many practical problems such as face recog...