Sciweavers

814 search results - page 145 / 163
» Optimal pairings
Sort
View
ISPD
2000
ACM
113views Hardware» more  ISPD 2000»
14 years 2 months ago
Floorplan area minimization using Lagrangian relaxation
modules can be handled in constraint graphs efficiently. This Floorplan area minimization is an important problem because many modules have shape flexibilities during the floorplan...
Fung Yu Young, Chris C. N. Chu, W. S. Luk, Y. C. W...
CGO
2004
IEEE
14 years 1 months ago
Exposing Memory Access Regularities Using Object-Relative Memory Profiling
Memory profiling is the process of characterizing a program's memory behavior by observing and recording its response to specific input sets. Relevant aspects of the program&...
Qiang Wu, Artem Pyatakov, Alexey Spiridonov, Easwa...
ESA
2006
Springer
140views Algorithms» more  ESA 2006»
14 years 1 months ago
Latency Constrained Aggregation in Sensor Networks
A sensor network consists of sensing devices which may exchange data through wireless communication. A particular feature of sensor networks is that they are highly energy constrai...
Luca Becchetti, Peter Korteweg, Alberto Marchetti-...
HICSS
1995
IEEE
128views Biometrics» more  HICSS 1995»
14 years 1 months ago
Instruction Level Parallelism
Abstract. We reexamine the limits of parallelism available in programs, using runtime reconstruction of program data-flow graphs. While limits of parallelism have been examined in...
APBC
2004
173views Bioinformatics» more  APBC 2004»
13 years 11 months ago
RNA Secondary Structure Prediction with Simple Pseudoknots
Pseudoknots are widely occurring structural motifs in RNA. Pseudoknots have been shown to be functionally important in different RNAs which play regulatory, catalytic, or structur...
Jitender S. Deogun, Ruben Donts, Olga Komina, Fang...