Sciweavers

1464 search results - page 90 / 293
» Behavioral optimization using the manipulation of timing con...
Sort
View
CORR
2011
Springer
199views Education» more  CORR 2011»
13 years 17 days ago
Maximum Gain Round Trips with Cost Constraints
Searching for optimal ways in a network is an important task in multiple application areas such as social networks, co-citation graphs or road networks. In the majority of applicat...
Franz Graf, Hans-Peter Kriegel, Matthias Schubert
DAC
2003
ACM
14 years 9 months ago
Partial task assignment of task graphs under heterogeneous resource constraints
This paper presents a novel partial assignment technique (PAT) that decides which tasks should be assigned to the same resource without explicitly defining assignment of these tas...
Radoslaw Szymanek, Krzysztof Kuchcinski
ISCAS
2006
IEEE
145views Hardware» more  ISCAS 2006»
14 years 2 months ago
The wordlength determination problem of linear time invariant systems with multiple outputs - a geometric programming approach
This paper proposes two new methods for optimizing objectives and constraints. The GP approach is very general and hardware resources in finite wordlength implementation of it allo...
S. C. Chan, K. M. Tsui
CORR
2006
Springer
116views Education» more  CORR 2006»
13 years 8 months ago
Memory Aware High-Level Synthesis for Embedded Systems
We introduce a new approach to take into account the memory architecture and the memory mapping in the High- Level Synthesis of Real-Time embedded systems. We formalize the memory...
Gwenolé Corre, Eric Senn, Nathalie Julien, ...
IEEEPACT
1997
IEEE
14 years 1 months ago
A Parallel Algorithm for Compile-Time Scheduling of Parallel Programs on Multiprocessors
† In this paper, we propose a parallel randomized algorithm, called Parallel Fast Assignment using Search Technique (PFAST), for scheduling parallel programs represented by direc...
Yu-Kwong Kwok, Ishfaq Ahmad