Show simple item record

dc.rights.licenseRestricted to current Rensselaer faculty, staff and students. Access inquiries may be directed to the Rensselaer Research Libraries.
dc.contributorKrishnamoorthy, M. S.
dc.contributorNewberg, Lee
dc.contributorBennett, Kristin P.
dc.contributorSpooner, David
dc.contributorZaki, Mohammed J., 1971-
dc.contributor.authorKilbride, James
dc.date.accessioned2021-11-03T10:46:07Z
dc.date.available2021-11-03T10:46:07Z
dc.date.created2007-10-26T15:37:20Z
dc.date.issued2006-12
dc.identifier.urihttps://hdl.handle.net/20.500.13015/3888
dc.descriptionDecember 2006
dc.descriptionSchool of Science
dc.language.isoENG
dc.publisherRensselaer Polytechnic Institute, Troy, NY
dc.relation.ispartofRensselaer Theses and Dissertations Online Collection
dc.subjectComputer science
dc.titleMethods for reformulating dynamic programming algorithms as representatively sampled algorithms
dc.typeElectronic thesis
dc.typeThesis
dc.digitool.pid8732
dc.digitool.pid8733
dc.digitool.pid8734
dc.rights.holderThis electronic version is a licensed copy owned by Rensselaer Polytechnic Institute, Troy, NY. Copyright of original work retained by author.
dc.description.degreePhD
dc.relation.departmentDept. of Computer Science


Files in this item

Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record