Please use this identifier to cite or link to this item:
|Title:||Dynamic programming using quantum search for optimizing petri net models|
|Citation:||International Federation of Operational Research, 2005|
|Conference Name:||IFORS 2005: International Federation of Operational Research Societies (2005 : Honolulu, Hawaii)|
|Sanjeev Naguleswaran, Olivier Buffet, Lang White|
|Abstract:||A technique for modeling planning problems as Petri-nets is presented. The routing of tokens through the net is analogous to sequential decision making, such as in MDPs. Standard DP algorithms cannot in general, solve planning problems in polynomial time. Hence, reduced complexity optimization methods based on quantum search are considered.|
|Appears in Collections:||Aurora harvest|
Electrical and Electronic Engineering publications
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.