Sciweavers

904 search results - page 135 / 181
» Scheduling task graphs optimally with A
Sort
View
MP
2010
163views more  MP 2010»
13 years 3 months ago
Speeding up IP-based algorithms for constrained quadratic 0-1 optimization
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...
Christoph Buchheim, Frauke Liers, Marcus Oswald
ICW
2005
IEEE
143views Communications» more  ICW 2005»
14 years 2 months ago
Distributed Mobility Control for Fault-Tolerant Mobile Networks
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...
Jie Lin
ICCD
2007
IEEE
150views Hardware» more  ICCD 2007»
14 years 20 days ago
CAP: Criticality analysis for power-efficient speculative multithreading
While Speculative Multithreading (SM) on a Chip Multiprocessor (CMP) has the ability to speed-up hard-toparallelize applications, the power inefficiency of aggressive speculation ...
James Tuck, Wei Liu, Josep Torrellas
EMSOFT
2010
Springer
13 years 6 months ago
Optimal WCET-aware code selection for scratchpad memory
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...
Hui Wu, Jingling Xue, Sridevan Parameswaran
PR
2010
145views more  PR 2010»
13 years 7 months ago
Graph-optimized locality preserving projections
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...
Limei Zhang, Lishan Qiao, Songcan Chen