Results 1 to 10 of about 666,113 (141)

Computer science, computer, computational complexity

Chebyshevskii sbornik, 2021
This article is based on a report made by V. N. Chubarikov at the International Scientific and Practical Conference "Informatization of Education — 2020" in the city of Orel, October 26–30, 2020. The conference was dedicated to the 115th anniversary of the birth of Patriarch of Russian education, the great teacher, and mathematician, academician S.
Vladimir Nikolaevich Chubarikov, Nikolai Nikolaevich Dobrovol’skii, Irina Yurievna Rebrova, Nikolai Mihailovich Dobrovol’skii   +3 more
openaire   +2 more sources

Parameterized Algorithmics for Computational Social Choice: Nine Research Challenges [PDF]

, 2014
Computational Social Choice is an interdisciplinary research area involving Economics, Political Science, and Social Science on the one side, and Mathematics and Computer Science (including Artificial Intelligence and Multiagent Systems) on the other ...
Bredereck, Robert, Chen, Jiehua, Faliszewski, Piotr, Guo, Jiong, Niedermeier, Rolf, Woeginger, Gerhard J.   +5 more
core   +9 more sources

Promoting learning transfer in science through a complexity approach and computational modeling

Instructional Science, 2023
This article concerns the synergy between science learning, understanding complexity, and computational thinking (CT), and their impact on near and far learning transfer. The potential relationship between computer-based model construction and knowledge transfer has yet to be explored.
Janan Saba, Hagit Hel-Or, Sharona T. Levy   +2 more
openaire   +2 more sources

Computational Complexity in Electronic Structure [PDF]

, 2012
In quantum chemistry, the price paid by all known efficient model chemistries is either the truncation of the Hilbert space or uncontrolled approximations.
Aaronson, Aharonov, Alán Aspuru-Guzik, Arora, Arora, Arora, Aspuru-Guzik, Aspuru-Guzik, Auerbach, Barahona, Batista, Ben-David, Bernstein, Berry, Biamonte, Biamonte, Bogdanov, Boyd, Bravyi, Brown, Brown, Chan, Chan, Chan, Cleveland, Coulson, Cramer, Deutsch, Dutta, Feynman, Foulkes, Grötschel, Hammond, Harrow, Helgaker, Hohenberg, Hong, Istrail, James Daniel Whitfield, Jordan, Kassal, Kassal, Kempe, Kitaev, Kitaev, Koch, Kohn, Lester Jr., Levine, Lieb, Liu, Lloyd, Love, Lu, Mazziotti, Mazziotti, Moore, Nielsen, Oliveira, Onsager, Ortiz, Osborne, Parr, Peter John Love, Rassolov, Schuch, Schuch, Schuch, Sipser, Somma, Szabo, Tempel, Troyer, Turing, Veis, Verstraete, Verstraete, Wei, Whitfield, Wu, Yung   +80 more
core   +3 more sources

Affective Computing as Complex Systems Science

Procedia Computer Science, 2016
AbstractPioneered in the early ‘90s by Rosalind Picard, a professor and IEEE Fellow of the MIT Media Lab, Affective Computing – rooted originally in artificial intelligence – now branches into wearable computing, big data, psychology, neuroscience, and modeling in order to advance the knowledge, understanding, and development of systems for sensing ...
William Lee, Michael D. Norman
openaire   +2 more sources

Computational studies of ruthenium and iridium complexes for energy sciences and progress on greener alternatives [PDF]

, 2022
The energy sciences attempt to meet the increasing world-wide need for energy, as well as sustainability goals, by cleaner sources of energy, by new alternative sources of energy, and by more efficient uses of available energy. These goals are entirely consistent with the principles of green chemistry.
Magero, Denis, Mestiri, Tarek, Alimi, Kamel, Casida, Mark, E   +3 more
openaire   +3 more sources

An extension of the dual complexity space and an application to Computer Science

Topology and its Applications, 2009
AbstractIn 1999, Romaguera and Schellekens introduced the theory of dual complexity spaces as a part of the development of a mathematical (topological) foundation for the complexity analysis of programs and algorithms [S. Romaguera, M.P. Schellekens, Quasi-metric properties of complexity spaces, Topology Appl. 98 (1999) 311–322]. In this work we extend
Jesús Rodríguez-López, Michel Schellekens, Oscar Valero   +2 more
openaire   +2 more sources

On the practically interesting instances of MAXCUT [PDF]

, 2012
The complexity of a computational problem is traditionally quantified based on the hardness of its worst case. This approach has many advantages and has led to a deep and beautiful theory.
Bilu, Yonatan, Daniely, Amit, Linial, Nati, Saks, Michael   +3 more
core   +6 more sources

Curricular Complexity Versus Quality of Computer Science Programs

, 2020
In this research paper we describe a study that involves measuring the complexities of undergraduate curricula offered by computer science departments, and then comparing them to the quality of these departments, where quality is determined by a metric-based ranking system.
Heileman, Gregory L., Free, Hayden W., Flynn, Johnny, Mackowiak, Camden, Jaromczyk, Jerzy W., Abdallah, Chaouki T.   +5 more
openaire   +2 more sources

Credimus

, 2019
We believe that economic design and computational complexity---while already important to each other---should become even more important to each other with each passing year. But for that to happen, experts in on the one hand such areas as social choice,
A Appel, A Shamir, C Lund, D Barrington, J Hartmanis, J Hartmanis, J Hartmanis, J Lutz, J Storer, J-Y Cai, L Fortnow, L Hemaspaandra, L Hemaspaandra, Michael Sipser, Moshe Y. Vardi, N Immerman, N Nisan, R Szelepcsényi, S Arora, S Kurtz, S Toda, W Gasarch   +21 more
core   +1 more source