{"entities":{"Q1139505":{"pageid":1150254,"ns":120,"title":"Item:Q1139505","lastrevid":66222276,"modified":"2026-04-12T08:21:46Z","type":"item","id":"Q1139505","labels":{"en":{"language":"en","value":"Dynamic programming is optimal for certain sequential decision processes"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 3675648"}},"aliases":{},"claims":{"P31":[{"mainsnak":{"snaktype":"value","property":"P31","hash":"fd5912e4dab4b881a8eb0eb27e7893fef55176ad","datavalue":{"value":{"entity-type":"item","numeric-id":56887,"id":"Q56887"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1139505$6453CCA0-E4D9-48EA-A31C-A7888BFA37E5","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"389ed47ed21801f08176a5b10547c107d3c0fec3","datavalue":{"value":{"text":"Dynamic programming is optimal for certain sequential decision processes","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q1139505$F9242511-117A-4933-BE81-28BD5C0762F5","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"8e2e7851e28db904d0e2f0c814dc5c0623420908","datavalue":{"value":"0433.90082","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1139505$1A42BBBB-AA30-4EE2-81BD-75BF81F0B99B","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"1f91a670ac3971838ed0fff3af9de11c382daf70","datavalue":{"value":"10.1016/0022-247X(80)90025-6","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1139505$21EF847A-DE34-4E75-9682-D6FBB9EC0C8E","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"164aea421e6fdaef124eb3c618f60af4f32e70af","datavalue":{"value":{"entity-type":"item","numeric-id":1139504,"id":"Q1139504"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1139505$C7F15B3E-B088-44D7-922A-654CD07488FE","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"c5ad7b9baf8e531c6b1ad954eb5f2899cc8fe5e5","datavalue":{"value":{"entity-type":"item","numeric-id":85344,"id":"Q85344"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1139505$5B240633-5BE3-44C2-B945-AFA0173D7A52","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"56afe75e154439409929c71e0e459d1542811b6e","datavalue":{"value":{"time":"+1980-00-00T00:00:00Z","timezone":0,"before":0,"after":0,"precision":9,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q1139505$D8462858-397C-47D6-BAB5-9455B8E53B33","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"e564314c10fa5b362951b280af9f9f70fb290f3e","datavalue":{"value":"90C47","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1139505$0EE3614D-95F1-4B60-A278-7A64C1D338FC","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"aa3ca91474fff28e420d9cace433f8447ec799b0","datavalue":{"value":"90C39","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1139505$9B1B6B03-5A0A-49AC-92C6-C58505B56969","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"5a3bb76dbd41580d9287ece5137de80ddf22202f","datavalue":{"value":"05C35","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1139505$4B068F29-6E1B-4606-8A64-DFCFE961AE91","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"d2d4f4e28fa9ca38421c473fcb6ba728a44de59a","datavalue":{"value":"90C35","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1139505$3CF2BF27-2656-4B75-A4EA-22051F04FCB2","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"b0b7f008a9592c96f6f2d9bcd2ec5e04691ba713","datavalue":{"value":"3675648","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1139505$05AA2A4D-F076-4171-9CE5-36881FEE88D2","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"0d82cfa81638332a8c825bcbbd9d7f7f9c0c45be","datavalue":{"value":"dynamic programming","type":"string"},"datatype":"string"},"type":"statement","id":"Q1139505$C39554AF-4EA3-456F-BC7C-6AF0B0E484A8","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"32131a3f40e730d89f44ad7748a1fb4e3e68e536","datavalue":{"value":"sequential decision processes","type":"string"},"datatype":"string"},"type":"statement","id":"Q1139505$28D4F664-3B74-4AB0-9337-727AFFB72837","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"7a0214e9d55d6225a434f621d846282ef181f64a","datavalue":{"value":"minimum-cost path","type":"string"},"datatype":"string"},"type":"statement","id":"Q1139505$7A8FC7A5-B6D3-4B06-B89F-4FA43183D018","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"7aa604107a97d1d64951750e1f59fd50107faf35","datavalue":{"value":"monotone loop-free sequential decision process","type":"string"},"datatype":"string"},"type":"statement","id":"Q1139505$108EE74E-944A-4809-B22D-60B03303232D","rank":"normal"}],"P1460":[{"mainsnak":{"snaktype":"value","property":"P1460","hash":"57f7fea50d2ce1b39b695c4a1313582eed405e38","datavalue":{"value":{"entity-type":"item","numeric-id":5976449,"id":"Q5976449"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1139505$638682E9-758D-482A-960F-2FB8B2CEB6F7","rank":"normal"}],"P223":[{"mainsnak":{"snaktype":"value","property":"P223","hash":"0a99eff2a82272ddd9483e3d1252f5af7cda77c2","datavalue":{"value":{"entity-type":"item","numeric-id":1228439,"id":"Q1228439"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1139505$2CF14A38-7B88-49A2-96C7-DAC883A8CE1D","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"694457bee6f8594efeea869392c907f1e80c487b","datavalue":{"value":{"entity-type":"item","numeric-id":2563309,"id":"Q2563309"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1139505$AA96CD7A-A7A9-461C-B75D-151DFF38B28C","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"340ea97c0f2f383d364057042ebc9f9438fcc85a","datavalue":{"value":{"entity-type":"item","numeric-id":4091421,"id":"Q4091421"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1139505$4921649D-F329-4FF8-9735-E22AF837DF5D","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"9615bb141660bd1bb23da644bf060d33da9de2f0","datavalue":{"value":{"entity-type":"item","numeric-id":2532893,"id":"Q2532893"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1139505$CEF9F1C2-7F01-4AE0-A5AB-49E5D92DAA4E","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"e23f273863469871a199ac4a03061a146b588596","datavalue":{"value":{"entity-type":"item","numeric-id":3937164,"id":"Q3937164"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1139505$A4DCD591-982D-48AE-9471-0CA952DDE8B6","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Dynamic programming is optimal for certain sequential decision processes","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Dynamic_programming_is_optimal_for_certain_sequential_decision_processes"}}}}}