Sciweavers

1165 search results - page 229 / 233
» Effective linear programming based placement methods
Sort
View
LCTRTS
2007
Springer
14 years 1 months ago
Scratchpad allocation for data aggregates in superperfect graphs
Existing methods place data or code in scratchpad memory, i.e., SPM by either relying on heuristics or resorting to integer programming or mapping it to a graph coloring problem. ...
Lian Li 0002, Quan Hoang Nguyen, Jingling Xue
MICRO
2006
IEEE
117views Hardware» more  MICRO 2006»
14 years 1 months ago
PathExpander: Architectural Support for Increasing the Path Coverage of Dynamic Bug Detection
Dynamic software bug detection tools are commonly used because they leverage run-time information. However, they suffer from a fundamental limitation, the Path Coverage Problem: t...
Shan Lu, Pin Zhou, Wei Liu, Yuanyuan Zhou, Josep T...
BMCBI
2008
95views more  BMCBI 2008»
13 years 7 months ago
PURE: A webserver for the prediction of domains in unassigned regions in proteins
Background: Protein domains are the structural and functional units of proteins. The ability to parse proteins into different domains is important for effective classification, un...
Chilamakuri C. S. Reddy, Khader Shameer, Bernard O...
DCOSS
2011
Springer
12 years 7 months ago
On sensor selection in linked information networks
—Sensor networks are often redundant by design; this is often done in order to achieve reliability in information processing. In many cases, the redundancy relationships between ...
Charu C. Aggarwal, Amotz Bar-Noy, Simon Shamoun
CODES
2003
IEEE
14 years 19 days ago
Design space minimization with timing and code size optimization for embedded DSP
One of the most challenging problems in high-level synthesis is how to quickly explore a wide range of design options to achieve high-quality designs. This paper presents an Integ...
Qingfeng Zhuge, Zili Shao, Bin Xiao, Edwin Hsing-M...