{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T01:28:09Z","timestamp":1740101289632,"version":"3.37.3"},"reference-count":21,"publisher":"IEEE","license":[{"start":{"date-parts":[[2022,10,12]],"date-time":"2022-10-12T00:00:00Z","timestamp":1665532800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,10,12]],"date-time":"2022-10-12T00:00:00Z","timestamp":1665532800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022,10,12]]},"DOI":"10.1109\/is57118.2022.10019719","type":"proceedings-article","created":{"date-parts":[[2023,1,25]],"date-time":"2023-01-25T18:48:51Z","timestamp":1674672531000},"page":"1-4","source":"Crossref","is-referenced-by-count":0,"title":["Seemingly Counter-Intuitive Features of Good-to-Great Companies Actually Make Perfect Sense: Possible Algorithmics-Based Explanations"],"prefix":"10.1109","author":[{"given":"Francisco","family":"Zapata","sequence":"first","affiliation":[{"name":"University of Texas at El Paso,Department of Industrial, Manufacturing, and Systems Engineering,El Paso,Texas,USA,79968"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eric","family":"Smith","sequence":"additional","affiliation":[{"name":"University of Texas at El Paso,Department of Industrial, Manufacturing, and Systems Engineering,El Paso,Texas,USA,79968"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Olga","family":"Kosheleva","sequence":"additional","affiliation":[{"name":"University of Texas at El Paso,Department of Teacher Education,El Paso,Texas,USA,79968"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vladik","family":"Kreinovich","sequence":"additional","affiliation":[{"name":"University of Texas at El Paso,Department of Computer Science,El Paso,Texas,USA,79968"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"volume-title":"Good to Great: Why Some Companies Make the Leap ...And Others Don\u2019t","year":"2001","author":"Collins","key":"ref1"},{"key":"ref2","article-title":"Theorie der majorisierbaren und stetigen Funktionale und ihre Anwendung bei der Extraktion von Schranken aus inkonstruktiven Beweisen: Effektive Eindeutigkeitsmodule bei besten Approximationen aus ineffektiven Eindeutigkeitsbeweisen","volume-title":"Ph.D. Dissertation","author":"Kohlenbach","year":"1990"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/0168-0072(93)90213-W"},{"volume-title":"Applied Proof Theory: Proof Interpretations and their Use in Mathematics","year":"2008","author":"Kohlenbach","key":"ref4"},{"key":"ref5","article-title":"Complexity measures: computability and applications","volume-title":"Master Thesis","author":"Kreinovich","year":"1974"},{"key":"ref6","first-page":"19","article-title":"Uniqueness implies algorithmic computability","volume-title":"Proceedings of the 4th Student Mathematical Conference","author":"Kreinovich"},{"key":"ref7","first-page":"22","article-title":"Reviewer\u2019s remarks in a review of D. S. Bridges","volume":"401","author":"Kreinovich","year":"1979","journal-title":"Constrictive functional analysis"},{"key":"ref8","article-title":"Categories of space-time models","volume-title":"Ph.D. dissertation","author":"Kreinovich","year":"1979"},{"issue":"1","key":"ref9","first-page":"174","article-title":"Unsolvability of several algorithmically solvable analytical problems","volume":"1","author":"Kreinovich","year":"1980","journal-title":"Abstracts Amer. Math. Soc."},{"key":"ref10","article-title":"Philosophy of Optimism: Notes on the possibility of using algorithm theory when describing historical processes, Leningrad Center for New Information Technology \u201cInformatika\u201d","volume-title":"Technical Report","author":"Kreinovich","year":"1989"},{"key":"ref11","first-page":"8","article-title":"Physics-motivated ideas for extracting efficient bounds (and algorithms) from classical proofs: beyond local compactness, beyond uniqueness","volume-title":"Abstracts of the Conference on the Methods of Proof Theory in Mathematics","author":"Kreinovich"},{"key":"ref12","article-title":"From Intervals to? Towards a General Description of Validated Uncertainty","volume-title":"Technical Report","author":"Kreinovich","year":"2004"},{"article-title":"Computational complexity of optimization and nonlinear equations with interval data","volume-title":"Abstracts of the Sixteenth Symposium on Mathematical Programming with Data Perturbation","author":"Kreinovich","key":"ref13"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-2793-7"},{"issue":"2","key":"ref15","first-page":"99","article-title":"Extracting computable bounds (and algorithms) from classical existence proofs: girard domains enable us to go beyond local compactness","volume":"12","author":"Kreinovich","year":"2019","journal-title":"International Journal of Intelligent Technologies and Applied Statistics (IJITAS)"},{"issue":"13","key":"ref16","first-page":"1040","article-title":"Les ensembles r\u00e9cursivement ouvert ou ferm\u00e9s, et leurs applications \u00e0 l\u2019analyse r\u00e9curslve","volume":"245","author":"Lacombe","year":"1957","journal-title":"Compt Rend."},{"key":"ref17","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/BF01117468","article-title":"Investigation of constructive functions by the method of fillings","volume":"1","author":"Lifschitz","year":"1973","journal-title":"J. Soviet Math."},{"issue":"5","key":"ref18","first-page":"223","volume":"2","author":"Longpr\u00e9","year":"2008","journal-title":"m"},{"volume-title":"Numerical Optimization","year":"2006","author":"Nocedal","key":"ref19"},{"volume-title":"Computational Complexity","year":"1994","author":"Papadimitriou","key":"ref20"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1201\/9780429186196"}],"event":{"name":"2022 IEEE 11th International Conference on Intelligent Systems (IS)","start":{"date-parts":[[2022,10,12]]},"location":"Warsaw, Poland","end":{"date-parts":[[2022,10,14]]}},"container-title":["2022 IEEE 11th International Conference on Intelligent Systems (IS)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/10019601\/10019606\/10019719.pdf?arnumber=10019719","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,13]],"date-time":"2024-02-13T07:57:34Z","timestamp":1707811054000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10019719\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,10,12]]},"references-count":21,"URL":"https:\/\/doi.org\/10.1109\/is57118.2022.10019719","relation":{},"subject":[],"published":{"date-parts":[[2022,10,12]]}}}