342 search results - page 43 / 69 » Automatic Generation of Heuristics for Scheduling |
TACAS
2004
Springer
15 years 4 months ago
2004
Springer
Abstract. The methods of Invisible Invariants and Invisible Ranking were developed originally in order to verify temporal properties of parameterized systems in a fully automatic m...
VMCAI
2004
Springer
15 years 4 months ago
2004
Springer
The method of Invisible Invariants was developed originally in order to verify safety properties of parameterized systems fully automatically. Roughly speaking, the method is based...
101
click to vote
ARCS
2009
Springer
15 years 5 months ago
2009
Springer
Abstract. Many-core processor architectures require scalable solutions that reflect the locality and power constraints of future generations of technology. This paper presents a CM...
109
click to vote
ICCAD
1994
IEEE
15 years 3 months ago
1994
IEEE
This paper presents a new method of selecting scan
ipops (FFs) in partial scan designs of sequential circuits. Scan FFs are chosen so that the whole circuit can be partitioned in...
DATE
2000
IEEE
15 years 3 months ago
2000
IEEE
Recently a number of heuristic based system-level synthesis algorithms have been proposed. Though these algorithms quickly generate good solutions, how close these solutions are t...