Keyword: Sequence Pair : Search

System Upgrade on Tue, May 28th, 2024 at 2am (EDT)

Existing users will be able to log into the site and access content. However, E-commerce and registration of new users may not be available for up to 12 hours.
For online purchase, please visit us again. Contact us at customercare@wspc.com for any enquiries.

Advanced Search

SEARCH GUIDE

Results: 1 - 1of1

Follow results:

per page:

Sort: Relevance

Context for search term 1Search term 1*

All Dates

LastSelect static range

Custom Range

Select starting monthSelect starting year

Select ending monthSelect ending year

Search name	Searched On	Run search
Keyword: Stream Cipher (11)	31 Mar 2025	Run
Keyword: Sequence Pair (1)	31 Mar 2025	Run
Keyword: Reengineering (8)	31 Mar 2025	Run
Keyword: Time Reversal (20)	31 Mar 2025	Run
Keyword: Triple Decker (2)	31 Mar 2025	Run

chapterNo Access
RESEARCH OF PLACEMENT AREA ESTIMATION BASED ON SEQUENCE PAIR
- Ning XU and
- Xianlong HONG
Proceedings of the 11th Joint International Computer Conference01 Oct 2005
Preview Abstract
A block placement representation called sequence pair was introduced by Murata. Many block placement algorithms that are based on sequence pairs use simulated annealing where the generation and evaluation of a large number of sequence pairs is required. This paper presents a new approach to evaluate a sequence pair based on computing longest common subsequence in a pair of weighted sequences. We present a very simple and efficient algorithm which has complexity lower than O(M^1.5), it is a significant improvement compared to the original O(M²) algorithm[1]. Experimental results show that our approach can estimate the area of a placement faster.

1