Results 191 to 200 of about 181,263 (248)
Analysis, control, and forecasting the dynamics of SIRD models with saturated treatment and nonlinear incidence. [PDF]
Sci RepElsonbaty A +5 more
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Theoretical Computer Science: Computational Complexity
A Guided Tour of Artificial Intelligence Research, 2020How much time, space and/or hardware resource does require an algorithm? Such questions lead to surprising results: conceptual simplicity does not always go along with efficiency. A lot of quite natural questions remain open, e.g., the famous P \(=\) NP problem raised in 1970.
Bournez, Olivier +6 more
openaire +4 more sources
Symmetry and Complexity in Computer Science
World Scientific Series on Nonlinear Science, Series A, 2005exaly +2 more sources
Computational Complexity of Covering Multigraphs with Semi-Edges: Small Cases
International Symposium on Mathematical Foundations of Computer Science, 2021We initiate the study of computational complexity of graph coverings, aka locally bijective graph homomorphisms, for {\em graphs with semi-edges}. The notion of graph covering is a discretization of coverings between surfaces or topological spaces, a ...
Jan Bok +4 more
semanticscholar +1 more source
The Complexity of the Shortest Vector Problem
Electron. Colloquium Comput. Complex., 2023Computational problems on point lattices play a central role in many areas of computer science including integer programming, coding theory, cryptanalysis, and especially the design of secure cryptosystems.
Huck Bennett
semanticscholar +1 more source
Bounded Rationality, Heuristics, Computational Complexity, and Artificial Intelligence
Advances in Strategic Management, 2018Herbert A. Simon and Alan Newell won the Turing Award jointly in Computer Science for foundational work on Artificial Intelligence. Simon also won the Nobel Prize in Economics for the concept of “bounded rationality.” In both cases, the same heuristic ...
R. Bettis, Songcui Hu
semanticscholar +1 more source
Noun Phrasal Complexity in Computer Science Conference Abstracts
International Journal of Computer-Assisted Language Learning and Teaching, 2022Noun phrase (NP) complexity research has shown the effects of both discipline and writing competence on NP complexity in academic writing and has focused more on applied linguistics. Yet few studies examined NPs in the academic writing of computer science (CS), especially in the CS conference abstract writing, in depth.
Yu Wang, Tianshuang Ge, Zhilei Ren
openaire +1 more source
Complexity of Infinite-Domain Constraint Satisfaction
, 2021Constraint Satisfaction Problems (CSPs) are natural computational problems that appear in many areas of theoretical computer science. Exploring which CSPs are solvable in polynomial time and which are NP-hard reveals a surprising link with central ...
M. Bodirsky
semanticscholar +1 more source
Complex game development by freshman computer science majors
ACM SIGCSE Bulletin, 2007This case study reveals Daniel Webster College's experience of increasing enrollments dramatically and igniting student enthusiasm for the computer sciences by combining complex game development with innovative classroom management techniques and non traditional student assessments. In this paper we discuss the classroom methods which favor independent
Tom Goulding, Rita DiTrolio
openaire +1 more source