LOGIN TO YOUR ACCOUNT

Username
Password
Remember Me
Or use your Academic/Social account:

CREATE AN ACCOUNT

Or use your Academic/Social account:

Congratulations!

You have just completed your registration at OpenAire.

Before you can login to the site, you will need to activate your account. An e-mail will be sent to you with the proper instructions.

Important!

Please note that this site is currently undergoing Beta testing.
Any new content you create is not guaranteed to be present to the final version of the site upon release.

Thank you for your patience,
OpenAire Dev Team.

Close This Message

CREATE AN ACCOUNT

Name:
Username:
Password:
Verify Password:
E-mail:
Verify E-mail:
*All Fields Are Required.
Please Verify You Are Human:
fbtwitterlinkedinvimeoflicker grey 14rssslideshare1
O'Connell, Jonathan F.; Mumford, Christine Lesley (2014)
Publisher: IEEE
Languages: English
Types: Unknown
Subjects: QA75
In this paper we present a dynamic programming based technique that is suitable for providing exact solutions to a subset of optimisation problems, using general purpose GPU computing. The primary feature of this model is to efficiently use the computational and memory resources of the GPU, whilst still remaining abstract enough to allow implementation on a variety of problems. Secondly, as exact dynamic programming methods are often limited by memory complexity, great consideration has been given to reducing this constraint, allowing large scale problems to be solved. To demonstrate the effectiveness of the proposed model we test it against three problems, the 0-1 knapsack problem, the longest common subsequence problem, and the travelling salesman problem.

Share - Bookmark

Cite this article