77 search results - page 7 / 16 » Timing optimization by restructuring long combinatorial path... |
ATS
2009
IEEE
13 years 5 months ago
2009
IEEE
Negative bias temperature instability (NBTI) has been a significant reliability concern in current digital circuit design due to its effect of increasing the path delay with time a...
ICC
2007
IEEE
13 years 11 months ago
2007
IEEE
High efficiency in capacity utilization and fast restoration are two primary goals of survivable design in optical networks. Shared backup path protection has been shown to be effi...
ICRA
2009
IEEE
14 years 2 months ago
2009
IEEE
— In this paper, we propose a method that detects repeated motion patterns in a long motion sequence efficiently. Repeated motion patterns are the structured information that ca...
CEC
2003
IEEE
14 years 21 days ago
2003
IEEE
Abstract- Simulated annealing (SA) is an effective general heuristic method for solving many combinatorial optimization problems. This paper deals with two problems in SA. One is ...
CPM
2009
Springer
13 years 5 months ago
2009
Springer
The longest-common-prefix (LCP) array is an adjunct to the suffix array that allows many string processing problems to be solved in optimal time and space. Its construction is a bo...