Transactions on Engineering and Computer Science
Peer Reviewed
Journal
Open Access
Publication
Rapid
Review Process
Global
Editorial Board
Bounding of 3-Partitioning Algorithm for NK Set
Osama Y. Abu Tammam
Abstract
Bounding of 3 partition algorithms decrease the time period of applying the algorithm for NK set depending on k value and required summation which generate the bounds of the algorithm. The flow chart of partitioning algorithm is constructed and simulated through Matlab. Matlab results are compared between bounded and un-bounded algorithm.
Keywords: Bounding; 3 Partition Algorithm; Matlab; NK Set; un-bounded
Journal Information
- Journal Name: Transactions on Engineering and Computer Science
- Journal Short Name: Trans Eng Comput Sci
- Language: English
- Format of Publication: Online
- Starting Year: 2020
- Focus Subject: Engineering and Computer Science
- Publication Model: Online
- Frequency of Publication: Two Issue a Year
- Review Process: Single blind peer-review by referees
- Time to 1st Decision: 2 to 3 weeks from date of submission
- Time to Acceptance: 4 to 6 weeks, depending upon the required revision cycles
- Time to Publication: 1 to 3 weeks from date of final submission in the forthcoming issue
- DOI Prefix: 10.7620
Indexed and Abstracted In
