Results 41 to 50 of about 1,693,747 (308)

Solving constraint satisfaction problems with networks of spiking neurons

open access: yesFrontiers 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

On the residual solvability of generalized free products of solvable groups

open access: yes, 2011
In this paper, we study the residual solvability of the generalized free product of solvable groups.Comment: Discrete Mathematics & Theoretical Computer Science, Vol 13 ...
Kahrobaei, Delaram, Majewicz, Stephen
core   +2 more sources

On the Descriptive Complexity of Color Coding

open access: yesAlgorithms, 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

Complexity vs Energy: Theory of Computation and Theoretical Physics [PDF]

open access: yes, 2013
This paper is a survey dedicated to the analogy between the notions of {\it complexity} in theoretical computer science and {\it energy} in physics. This analogy is not metaphorical: I describe three precise mathematical contexts, suggested recently, in ...
Manin, Yuri I.
core   +1 more source

The unpredictably eruptive dynamics of spruce budworm populations in eastern Canada

open access: yesPopulation Ecology, EarlyView.
We examine historical population data for spruce budworm from several locations through the period 1930–1997, and use density‐dependent recruitment curves to test whether the pattern of population growth over time is more consistent with Royama's (1984; Ecological Monographs 54:429–462) linear R(t) model of harmonic oscillation at Green River New ...
Barry J. Cooke, Jacques Régnière
wiley   +1 more source

Quantum Communication Technology

open access: yes, 2010
Quantum communication is built on a set of disruptive concepts and technologies. It is driven by fascinating physics and by promising applications. It requires a new mix of competencies, from telecom engineering to theoretical physics, from theoretical ...
Gisin, Nicolas, Thew, Rob
core   +3 more sources

Demon-like Algorithmic Quantum Cooling and its Realization with Quantum Optics [PDF]

open access: yes, 2012
The simulation of low-temperature properties of many-body systems remains one of the major challenges in theoretical and experimental quantum information science.
A Aspuru-Guzik   +37 more
core   +2 more sources

Network topology drives population temporal variability in experimental habitat networks

open access: yesPopulation Ecology, EarlyView.
Habitat patches connected by dispersal pathways form habitat networks. We explored how network topology affects population outcomes in laboratory experiments using a model species (Daphnia carinata). Central habitat nodes in complex lattice networks exhibited lower temporal variability in population sizes, suggesting they support more stable ...
Yiwen Xu   +3 more
wiley   +1 more source

An Improved Simulated Annealing Algorithm With Excessive Length Penalty for Fixed-Outline Floorplanning

open access: yesIEEE 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

Complexity of ITL model checking: some well-behaved fragments of the interval logic HS

open access: yes, 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

Home - About - Disclaimer - Privacy