1550 search results - page 194 / 310 » Benchmarking for Graph Transformation |
120
Voted
EMSOFT
2005
Springer
15 years 8 months ago
2005
Springer
Abstract— This paper explores the problem of efficiently ordering interprocessor communication operations in both statically and dynamically-scheduled multiprocessors for iterat...
123
click to vote
GECCO
2005
Springer
15 years 8 months ago
2005
Springer
This paper proposes a novel constructive learning algorithm for a competitive neural network. The proposed algorithm is developed by taking ideas from the immune system and demons...
154
click to vote
ICDCIT
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. Statically estimating the worst case execution time of a program is important for real-time embedded software. This is difficult even in the programming language level du...
109
click to vote
ISPD
2004
ACM
15 years 8 months ago
2004
ACM
Due to increasing design complexity, routing congestion has become a critical problem in VLSI designs. This paper introduces a distributed metric to predict routing congestion for...
140
click to vote
PPSN
2004
Springer
15 years 8 months ago
2004
Springer
This paper introduces a new evaluation function, called δ, for the Bandwidth Minimization Problem for Graphs (BMPG). Compared with the classical β evaluation function used, our ...