نتایج جستجو برای: maximal hub covering

تعداد نتایج: 152767  

Journal: :Computational Urban Science 2022

Abstract In this article, we present the process and results of using quantum computing (QC) to solve maximal covering location problem proposed by Church ReVelle. With contribution, seek lay foundations for other urban regional scientists begin consider technologies. We obtained promising results, but it is clear that there a need more capable devices with qubits less susceptibility electronic...

Journal: :International Journal of Industrial Engineering Computations 2018

2014
Gabrielle J. Gutierrez Eve Marder

When does neuromodulation of a single neuron influence the output of the entire network? We constructed a five-cell circuit in which a neuron is at the center of the circuit and the remaining neurons form two distinct oscillatory subnetworks. All neurons were modeled as modified Morris– Lecar models with a hyperpolarization-activated conductance (ḡh) in addition to calcium (ḡCa), potassium (ḡK)...

Journal: :eNeuro 2014
Gabrielle J Gutierrez Eve Marder

When does neuromodulation of a single neuron influence the output of the entire network? We constructed a five-cell circuit in which a neuron is at the center of the circuit and the remaining neurons form two distinct oscillatory subnetworks. All neurons were modeled as modified Morris-Lecar models with a hyperpolarization-activated conductance (ḡh ) in addition to calcium (ḡCa ), potassium (ḡK...

2015
S. Sedehzadeh R. Tavakkoli-Moghaddam F. Jolai

One main group of a transportation network is a discrete hub covering problem that seeks to minimize the total transportation cost. This paper presents a multi-product and multi-mode hub covering model, in which the transportation time depends on travelling mode between each pair of hubs. Indeed, the nature of products is considered different and hub capacity constraint is also applied. Due to ...

Journal: :Multiple-Valued Logic and Soft Computing 2012
Karsten Schölzel

We determine the minimal covering of maximal partial clones in 4-valued logic. That means a necessary and sufficient condition for partial Sheffer functions in 4-valued logic in terms of the maximal partial clones is established. Furthermore several statements about members of the minimal covering of the maximal partial clones for any finite-valued logic are established.

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید