Results 31 to 40 of about 1,799,217 (181)
Solving constraint satisfaction problems with networks of spiking neurons
Frontiers in Neuroscience, 2016 Network of neurons in the brain apply – unlike processors in our current generation ofcomputer hardware – an event-based processing strategy, where short pulses (spikes) areemitted sparsely by neurons to signal the occurrence of an event at a particular ...
Zeno eJonke +2 more
doaj +1 more source
IEEE Access, 2020 In addition to wirelength and area, modern floorplans need to consider various constraints such as fixed-outline. To handle the fixed-outline floorplanning optimization problem efficiently, we propose an improved simulated annealing (SA) algorithm, which
Zhipeng Huang +3 more
doaj +1 more source
On the Descriptive Complexity of Color Coding
Algorithms, 2021 Color coding is an algorithmic technique used in parameterized complexity theory to detect “small” structures inside graphs. The idea is to derandomize algorithms that first randomly color a graph and then search for an easily-detectable, small color ...
Max Bannach, Till Tantau
doaj +1 more source
Graph Grammars, Insertion Lie Algebras, and Quantum Field Theory [PDF]
, 2015 Graph grammars extend the theory of formal languages in order to model distributed parallelism in theoretical computer science. We show here that to certain classes of context-free and context-sensitive graph grammars one can associate a Lie algebra ...
Marcolli, Matilde, Port, Alexander
core +3 more sources
Revista Brasileira de Ensino de Ciência e Tecnologia, 2021 This paper aims to understand the didactic formation of teachers/professors in IT and Computer Science from campus Colinas do Tocantins, of the Tocantins Federal Institute for Education, Science and Technology (IFTO).
Eliane Mittelstad Martins de Souza +3 more
doaj +1 more source
Complexity of ITL model checking: some well-behaved fragments of the interval logic HS
, 2015 Model checking has been successfully used in many computer science fields, including artificial intelligence, theoretical computer science, and databases.
Molinari, A., Montanari, A., Peron, A.
core +1 more source
Proof of Blum's conjecture on hexagonal dungeons [PDF]
, 2014 Matt Blum conjectured that the number of tilings of the Hexagonal Dungeon of sides $a,\ 2a,\ b,\ a,\ 2a,\ b$ (where $b\geq 2a$) is $13^{2a^2}14^{\lfloor\frac{a^2}{2}\rfloor}$ (J.
Ciucu, Mihai, Lai, Tri
core +1 more source
The Era of Big Data Comes to Oceanography [PDF]
Oceanography, 2013 The late Jim Gray, who received the prestigious Turing Award in computer science and was a pioneer in the development of relational databases, proposed the "Fourth Paradigm" to describe the field of data-intensive science (Hey et al., 2009).
Mark R. Abbott
doaj +1 more source
Lagrange Dual Method for Sparsity Constrained Optimization
IEEE Access, 2018 In this paper, we investigate the l0 quasi-norm constrained optimization problem in the Lagrange dual framework and show that the strong duality property holds.
Wenxing Zhu +3 more
doaj +1 more source
, 2011 In recent years we've seen the birth of a new field known as hamiltonian complexity lying at the crossroads between computer science and theoretical physics.
Osborne, Tobias J.
core +1 more source