1629 search results - page 129 / 326 » Hardness Results and Efficient Algorithms for Graph Powers |
COR
2008
14 years 10 months ago
2008
In this paper, an improved Two-Stage Simulated Annealing algorithm is presented for the Minimum Linear Arrangement Problem for Graphs. This algorithm integrates several distinguis...
ASPDAC
2004
ACM
15 years 1 months ago
2004
ACM
- Minimum area is one of the important objectives in technology mapping for lookup table-based FPGAs. It has been proven that the problem is NP-complete. This paper presents a poly...
AICCSA
2007
IEEE
15 years 4 months ago
2007
IEEE
This paper presents an encoding algorithm that is very efficient for many different logic synthesis problems. The algorithm is based on the use of special tables and includes two ...
ESCIENCE
2007
IEEE
15 years 4 months ago
2007
IEEE
Effective scheduling is a key concern for the execution of performance driven Grid applications. In this paper, we propose a Dynamic Critical Path (DCP) based workflow scheduling ...
92
Voted
VLSID
2006
IEEE
15 years 10 months ago
2006
IEEE
Logarithmic Number Systems (LNS) offer a viable alternative in terms of area, delay and power to binary number systems for multiplication and division operations in signal process...