Увійти

Готові списки джерел за темами / Deterministic constant time algorithms / Статті в журналах

Щоб переглянути інші типи публікацій з цієї теми, перейдіть за посиланням: Deterministic constant time algorithms.

Статті в журналах з теми "Deterministic constant time algorithms"

Автор: Grafiati

Опубліковано: 30 травня 2022

Оновлено: 31 травня 2022

Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями

Оберіть тип джерела:

Ознайомтеся з топ-50 статей у журналах для дослідження на тему "Deterministic constant time algorithms".

Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.

Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.

Переглядайте статті в журналах для різних дисциплін та оформлюйте правильно вашу бібліографію.

1

Jayanti, Prasad, and Siddhartha Jayanti. "Deterministic Constant-Amortized-RMR Abortable Mutex for CC and DSM." ACM Transactions on Parallel Computing 8, no. 4 (2021): 1–26. http://dx.doi.org/10.1145/3490559.

Повний текст джерела

Анотація:

The abortable mutual exclusion problem, proposed by Scott and Scherer in response to the needs in real-time systems and databases, is a variant of mutual exclusion that allows processes to abort from their attempt to acquire the lock. Worst-case constant remote memory reference algorithms for mutual exclusion using hardware instructions such as Fetch&Add or Fetch&Store have long existed for both cache coherent (CC) and distributed shared memory multiprocessors, but no such algorithms are known for abortable mutual exclusion. Even relaxing the worst-case requirement to amortized, algori

Стилі APA, Harvard, Vancouver, ISO та ін.

2

SUEL, TORSTEN. "PERMUTATION ROUTING AND SORTING ON MESHES WITH ROW AND COLUMN BUSES." Parallel Processing Letters 05, no. 01 (1995): 63–80. http://dx.doi.org/10.1142/s0129626495000072.

Повний текст джерела

Анотація:

We study the problems of permutation routing and sorting on several models of meshes with fixed and reconfigurable row and column buses. We describe two fast and fairly simple deterministic algorithms for permutation routing on two-dimensional networks, and a more complicated algorithm for multi-dimensional networks. The algorithms are obtained by converting two known off-line routing schemes into deterministic routing algorithms, and they can be implemented on a variety of different models of meshes with buses. We also give a deterministic algorithm for 1–1 sorting whose running time matches

Стилі APA, Harvard, Vancouver, ISO та ін.

3

DAS, SAJAL K., and RANETTE H. HALVERSON. "SIMPLE DETERMINISTIC AND RANDOMIZED ALGORITHMS FOR LINKED LIST RANKING ON THE EREW PRAM MODEL." Parallel Processing Letters 04, no. 01n02 (1994): 15–27. http://dx.doi.org/10.1142/s012962649400003x.

Повний текст джерела

Анотація:

An asynchronous, CRCW PRAM (or APRAM) algorithm for linked list ranking, proposed by Martel and Subramonian, performs EO (n log log n) expected work employing [Formula: see text] processors. Motivated by their unique approach, this paper proposes two EREW list ranking algorithms – one deterministic and the other randomized. The deterministic algorithm performs in [Formula: see text] time using p processors, where n≥p log p. Thus, for p= O (n/ log n), it requires O ( log n log log n) time and O (n log log n) work. Although not work-optimal, this algorithm is very simple compared to the known wo

Стилі APA, Harvard, Vancouver, ISO та ін.

4

Khadiev, Kamil, and Vladislav Remidovskii. "Classical and Quantum Algorithms for Assembling a Text from a Dictionary." Nonlinear Phenomena in Complex Systems 24, no. 3 (2021): 207–21. http://dx.doi.org/10.33581/1561-4085-2021-24-3-207-221.

Повний текст джерела

Анотація:

We study algorithms for solving the problem of assembling a text (long string) from a dictionary (a sequence of small strings). The problem has an application in bioinformatics and has a connection with the sequence assembly method for reconstructing a long deoxyribonucleic-acid (DNA) sequence from small fragments. The problem is assembling a string t of length n from strings s1,...,sm. Firstly, we provide a classical (randomized) algorithm with running time Õ(nL0.5 + L) where L is the sum of lengths of s1,...,sm. Secondly, we provide a quantum algorithm with running time Õ(nL0.25 + √mL). Thir

Стилі APA, Harvard, Vancouver, ISO та ін.

5

Allender, Eric, V. Arvind, Rahul Santhanam, and Fengming Wang. "Uniform derandomization from pathetic lower bounds." Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences 370, no. 1971 (2012): 3512–35. http://dx.doi.org/10.1098/rsta.2011.0318.

Повний текст джерела

Анотація:

The notion of probabilistic computation dates back at least to Turing, who also wrestled with the practical problems of how to implement probabilistic algorithms on machines with, at best, very limited access to randomness. A more recent line of research, known as derandomization, studies the extent to which randomness is superfluous. A recurring theme in the literature on derandomization is that probabilistic algorithms can be simulated quickly by deterministic algorithms, if one can obtain impressive (i.e. superpolynomial, or even nearly exponential) circuit size lower bounds for certain pro

Стилі APA, Harvard, Vancouver, ISO та ін.

6

Rajasekaran, Sanguthevar. "On the Euclidean Minimum Spanning Tree Problem." Computing Letters 1, no. 1 (2005): 11–14. http://dx.doi.org/10.1163/1574040053326325.

Повний текст джерела

Анотація:

Given a weighted graph G(V;E), a minimum spanning tree for G can be obtained in linear time using a randomized algorithm or nearly linear time using a deterministic algorithm. Given n points in the plane, we can construct a graph with these points as nodes and an edge between every pair of nodes. The weight on any edge is the Euclidean distance between the two points. Finding a minimum spanning tree for this graph is known as the Euclidean minimum spanning tree problem (EMSTP). The minimum spanning tree algorithms alluded to before will run in time O(n2) (or nearly O(n2)) on this graph. In thi

Стилі APA, Harvard, Vancouver, ISO та ін.

7

Efthymiou, Charilaos. "Deterministic counting of graph colourings using sequences of subgraphs." Combinatorics, Probability and Computing 29, no. 4 (2020): 555–86. http://dx.doi.org/10.1017/s0963548320000255.

Повний текст джерела

Анотація:

AbstractIn this paper we propose a polynomial-time deterministic algorithm for approximately counting the k-colourings of the random graph G(n, d/n), for constant d>0. In particular, our algorithm computes in polynomial time a $(1\pm n^{-\Omega(1)})$ -approximation of the so-called ‘free energy’ of the k-colourings of G(n, d/n), for $k\geq (1+\varepsilon) d$ with probability $1-o(1)$ over the graph instances.Our algorithm uses spatial correlation decay to compute numerically estimates of marginals of the Gibbs distribution. Spatial correlation decay has been used in different counting schem

Стилі APA, Harvard, Vancouver, ISO та ін.

8

Tarnawski, Jakub. "New graph algorithms via polyhedral techniques." it - Information Technology 63, no. 3 (2021): 177–82. http://dx.doi.org/10.1515/itit-2021-0014.

Повний текст джерела

Анотація:

Abstract This article gives a short overview of my dissertation, where new algorithms are given for two fundamental graph problems. We develop novel ways of using linear programming formulations, even exponential-sized ones, to extract structure from problem instances and to guide algorithms in making progress. The first part of the dissertation addresses a benchmark problem in combinatorial optimization: the asymmetric traveling salesman problem (ATSP). It consists in finding the shortest tour that visits all vertices of a given edge-weighted directed graph. A ρ-approximation algorithm for AT

Стилі APA, Harvard, Vancouver, ISO та ін.

9

Hu, Xiao-Bing, Ming Wang, Mark S. Leeson, Ezequiel A. Di Paolo, and Hao Liu. "Deterministic Agent-Based Path Optimization by Mimicking the Spreading of Ripples." Evolutionary Computation 24, no. 2 (2016): 319–46. http://dx.doi.org/10.1162/evco_a_00156.

Повний текст джерела

Анотація:

Inspirations from nature have contributed fundamentally to the development of evolutionary computation. Learning from the natural ripple-spreading phenomenon, this article proposes a novel ripple-spreading algorithm (RSA) for the path optimization problem (POP). In nature, a ripple spreads at a constant speed in all directions, and the node closest to the source is the first to be reached. This very simple principle forms the foundation of the proposed RSA. In contrast to most deterministic top-down centralized path optimization methods, such as Dijkstra’s algorithm, the RSA is a bottom-up dec

Стилі APA, Harvard, Vancouver, ISO та ін.

10

Mehta, Dinesh P., Carl Shetters, and Donald W. Bouldin. "Meta-Algorithms for Scheduling a Chain of Coarse-Grained Tasks on an Array of Reconfigurable FPGAs." VLSI Design 2013 (December 25, 2013): 1–13. http://dx.doi.org/10.1155/2013/249592.

Повний текст джерела

Анотація:

This paper considers the problem of scheduling a chain of n coarse-grained tasks on a linear array of k reconfigurable FPGAs with the objective of primarily minimizing reconfiguration time. A high-level meta-algorithm along with two detailed meta-algorithms (GPRM and SPRM) that support a wide range of problem formulations and cost functions is presented. GPRM, the more general of the two schemes, reduces the problem to computing a shortest path in a DAG; SPRM, the less general scheme, employs dynamic programming. Both meta algorithms are linear in n and compute optimal solutions. GPRM can be e

Стилі APA, Harvard, Vancouver, ISO та ін.

11

Hsu, Geesern, Andrew E. Yagle, Kenneth C. Ludema, and Joel A. Levitt. "Modeling and Identification of Lubricated Polymer Friction Dynamics." Journal of Dynamic Systems, Measurement, and Control 122, no. 1 (1996): 78–88. http://dx.doi.org/10.1115/1.482431.

Повний текст джерела

Анотація:

A systematic approach is proposed to model the dynamics of lubricated polymer friction. It starts with the development of a physical model to describe the fundamental mechanisms of the friction. The physical model then serves as the basic structure for the development of a complex model able to capture a wider spectrum of the deterministic and stochastic dynamics of friction. To assess the accuracy of the complex model, two estimation algorithms are formulated to estimate the unknown parameters in the model and to test the model against experimental data. One algorithm is based on the maximum

Стилі APA, Harvard, Vancouver, ISO та ін.

12

HERLEY, KIERAN T., ANDREA PIETRACAPRINA, and GEPPINO PUCCI. "FAST DETERMINISTIC PARALLEL BRANCH-AND-BOUND." Parallel Processing Letters 09, no. 03 (1999): 325–33. http://dx.doi.org/10.1142/s012962649900030x.

Повний текст джерела

Анотація:

The branch-and-bound problem involves determining the minimum cost leaf in a cost-labelled tree, subject to the constraint that only the root is known initially and that children are revealed only by visiting thier parent. We present the first efficient deterministic algorithm to solve the branch-and-bound problem for a tree T of constant degree on a p-processor parallel machine. Let c* be the cost of the minimum-cost leaf in T, and let n and h be the number of nodes and the height, respectively, of the subtree T* ⊆ T of nodes of cost less than or equal to c*. Our algorithm runs in O(n/p + h l

Стилі APA, Harvard, Vancouver, ISO та ін.

13

Singh, Mohit, and Weijun Xie. "Approximation Algorithms for D-optimal Design." Mathematics of Operations Research 45, no. 4 (2020): 1512–34. http://dx.doi.org/10.1287/moor.2019.1041.

Повний текст джерела

Анотація:

Experimental design is a classical statistics problem, and its aim is to estimate an unknown vector from linear measurements where a Gaussian noise is introduced in each measurement. For the combinatorial experimental design problem, the goal is to pick a subset of experiments so as to make the most accurate estimate of the unknown parameters. In this paper, we will study one of the most robust measures of error estimation—the D-optimality criterion, which corresponds to minimizing the volume of the confidence ellipsoid for the estimation error. The problem gives rise to two natural variants d

Стилі APA, Harvard, Vancouver, ISO та ін.

14

Bramas, Quentin, and Sébastien Tixeuil. "The Random Bit Complexity of Mobile Robots Scattering." International Journal of Foundations of Computer Science 28, no. 02 (2017): 111–33. http://dx.doi.org/10.1142/s0129054117500083.

Повний текст джерела

Анотація:

We consider the problem of scattering n robots in a two dimensional continuous space. As this problem is impossible to solve in a deterministic manner, all solutions must be probabilistic. We investigate the amount of randomness (that is, the number of random bits used by the robots) that is required to achieve scattering. We first prove that n log n random bits are necessary to scatter n robots in any setting. Also, we give a sufficient condition for a scattering algorithm to be random bit optimal. As it turns out that previous solutions for scattering satisfy our condition, they are hence pr

Стилі APA, Harvard, Vancouver, ISO та ін.

15

Datta, Ajoy K., Stephane Devismes, Lawrence L. Larmore, and Vincent Villain. "Self-Stabilizing Weak Leader Election in Anonymous Trees Using Constant Memory per Edge." Parallel Processing Letters 27, no. 02 (2017): 1750002. http://dx.doi.org/10.1142/s0129626417500025.

Повний текст джерела

Анотація:

We propose a deterministic silent self-stabilizing algorithm for the weak leader election problem in anonymous trees. Our algorithm is designed in the message passing model, and requires only O(1) bits of memory per edge. It does not necessitate the a priori knowledge of any global parameter on the network. Finally, its stabilization time is at most [Formula: see text] time units, where 𝒟 is the diameter of the network, X is an upper bound on the time to execute some recurrent code by processes, and Imax is the maximal number of messages initially in a link.

Стилі APA, Harvard, Vancouver, ISO та ін.

16

Ławryńczuk, Maciej. "Nonlinear State–Space Predictive Control with On–Line Linearisation and State Estimation." International Journal of Applied Mathematics and Computer Science 25, no. 4 (2015): 833–47. http://dx.doi.org/10.1515/amcs-2015-0060.

Повний текст джерела

Анотація:

Abstract This paper describes computationally efficient model predictive control (MPC) algorithms for nonlinear dynamic systems represented by discrete-time state-space models. Two approaches are detailed: in the first one the model is successively linearised on-line and used for prediction, while in the second one a linear approximation of the future process trajectory is directly found on-line. In both the cases, as a result of linearisation, the future control policy is calculated by means of quadratic optimisation. For state estimation, the extended Kalman filter is used. The discussed MPC

Стилі APA, Harvard, Vancouver, ISO та ін.

17

Liang, Dieyan, and Hong Shen. "Efficient Algorithms for Max-Weighted Point Sweep Coverage on Lines." Sensors 21, no. 4 (2021): 1457. http://dx.doi.org/10.3390/s21041457.

Повний текст джерела

Анотація:

As an important application of wireless sensor networks (WSNs), deployment of mobile sensors to periodically monitor (sweep cover) a set of points of interest (PoIs) arises in various applications, such as environmental monitoring and data collection. For a set of PoIs in an Eulerian graph, the point sweep coverage problem of deploying the fewest sensors to periodically cover a set of PoIs is known to be Non-deterministic Polynomial Hard (NP-hard), even if all sensors have the same velocity. In this paper, we consider the problem of finding the set of PoIs on a line periodically covered by a g

Стилі APA, Harvard, Vancouver, ISO та ін.

18

HERLEY, KIERAN T., ANDREA PIETRACAPRINA, and GEPPINO PUCCI. "DETERMINISTIC BRANCH-AND-BOUND ON DISTRIBUTED MEMORY MACHINES." International Journal of Foundations of Computer Science 10, no. 04 (1999): 391–404. http://dx.doi.org/10.1142/s0129054199000289.

Повний текст джерела

Анотація:

The branch-and-bound problem involves determining the leaf of minimum cost in a cost-labelled, heap-ordered tree, subject to the constraint that only the root is known initially and that the children of a node are revealed only by visiting their parent. We present the first efficient deterministic algorithm to solve the branch-and-bound problem for a tree T of constant degree on a p-procesor distributed-memory Optically Connected Parallel Computer (OCPC). Let c* be the cost of the minimum-cost leaf in T, and let n and h be the number of nodes and the height, respectively, of the subtree T*⊆T o

Стилі APA, Harvard, Vancouver, ISO та ін.

19

Arenas, Marcelo, Luis Alberto Croquevielle, Rajesh Jayaram, and Cristian Riveros. "#NFA Admits an FPRAS: Efficient Enumeration, Counting, and Uniform Generation for Logspace Classes." Journal of the ACM 68, no. 6 (2021): 1–40. http://dx.doi.org/10.1145/3477045.

Повний текст джерела

Анотація:

In this work, we study two simple yet general complexity classes, based on logspace Turing machines, that provide a unifying framework for efficient query evaluation in areas such as information extraction and graph databases, among others. We investigate the complexity of three fundamental algorithmic problems for these classes: enumeration, counting, and uniform generation of solutions, and show that they have several desirable properties in this respect. Both complexity classes are defined in terms of non-deterministic logspace transducers (NL-transducers). For the first class, we consider

Стилі APA, Harvard, Vancouver, ISO та ін.

20

CABELLO, SERGIO, MARK DE BERG, PANOS GIANNOPOULOS, CHRISTIAN KNAUER, RENÉ VAN OOSTRUM, and REMCO C. VELTKAMP. "MAXIMIZING THE AREA OF OVERLAP OF TWO UNIONS OF DISKS UNDER RIGID MOTION." International Journal of Computational Geometry & Applications 19, no. 06 (2009): 533–56. http://dx.doi.org/10.1142/s0218195909003118.

Повний текст джерела

Анотація:

Let A and B be two sets of n resp. m disjoint unit disks in the plane, with m ≥ n. We consider the problem of finding a translation or rigid motion of A that maximizes the total area of overlap with B. The function describing the area of overlap is quite complex, even for combinatorially equivalent translations and, hence, we turn our attention to approximation algorithms. We give deterministic (1 - ∊)-approximation algorithms for translations and for rigid motions, which run in O((nm/∊2) log (m/∊)) and O((n2m2/∊3) log m)) time, respectively. For rigid motions, we can also compute a (1 - ∊)-ap

Стилі APA, Harvard, Vancouver, ISO та ін.

21

Ezemobi, Ethelbert, Andrea Tonoli, and Mario Silvagni. "Battery State of Health Estimation with Improved Generalization Using Parallel Layer Extreme Learning Machine." Energies 14, no. 8 (2021): 2243. http://dx.doi.org/10.3390/en14082243.

Повний текст джерела

Анотація:

The online estimation of battery state of health (SOH) is crucial to ensure the reliability of the energy supply in electric and hybrid vehicles. An approach for enhancing the generalization of SOH estimation using a parallel layer extreme learning machine (PL-ELM) algorithm is analyzed in this paper. The deterministic and stable PL-ELM model is designed to overcome the drift problem that is associated with some conventional machine learning algorithms; hence, extending the application of a single SOH estimation model over a large set of batteries of the same type. The PL-ELM model was trained

Стилі APA, Harvard, Vancouver, ISO та ін.

22

BEGGS, EDWIN J., JOSÉ FÉLIX COSTA, and JOHN V. TUCKER. "The impact of models of a physical oracle on computational power." Mathematical Structures in Computer Science 22, no. 5 (2012): 853–79. http://dx.doi.org/10.1017/s0960129511000557.

Повний текст джерела

Анотація:

Using physical experiments as oracles for algorithms, we can characterise the computational power of classes of physical systems. Here we show that two different physical models of the apparatus for a single experiment can have different computational power. The experiment is thescatter machine experiment(SME), which was first presented in Beggs and Tucker (2007b). Our first physical model contained a wedge with a sharp vertex that made the experiment non-deterministic with constant runtime. We showed that Turing machines with polynomial time and an oracle based on a sharp wedge computed the n

Стилі APA, Harvard, Vancouver, ISO та ін.

23

AL-SAFAR, AHMED. "Hybrid CPU Scheduling algorithm SJF-RR In Static Set of Processes." Journal of Al-Rafidain University College For Sciences ( Print ISSN: 1681-6870 ,Online ISSN: 2790-2293 ), no. 1 (October 20, 2021): 36–60. http://dx.doi.org/10.55562/jrucs.v29i1.377.

Повний текст джерела

Анотація:

Round Robin (RR) algorithm is widely used in modern operating systems (OS) as it has a better responsiveness as periodic quantum (occurring at regular intervals) in addition to have a good feature such as low scheduling overhead of n processes in a ready queue which takes a constant time O(1). But, RR algorithms have the worse features such as having low throughput, long average turnaround and waiting time, in addition to the number of context switches for (n) processes is (n) switches. Shortest Job First (SJF) however, itself is not practical in time sharing Oss due to its low response. More

Стилі APA, Harvard, Vancouver, ISO та ін.

24

Ma, Jingjing. "3D DNA Self-Assembly Algorithmic Model to Solve the Hamiltonian Path Problem." Journal of Nanoelectronics and Optoelectronics 16, no. 5 (2021): 731–37. http://dx.doi.org/10.1166/jno.2021.3000.

Повний текст джерела

Анотація:

Self-assembly reveals the innate character of DNA computing, DNA self-assembly is regarded as the best way to make DNA computing transform into computer chip. This paper introduces a strategy of DNA 3D self-assembly algorithm to solve the Hamiltonian Path Problem. Firstly, I introduced a non-deterministic algorithm. Then, according to the algorithm I designed the types of DNA tiles which the computing process needs. Lastly, I demonstrated the self-assembly process and the experimental methods which can get the final result. The computing time is linear, and the number of the different tile typ

Стилі APA, Harvard, Vancouver, ISO та ін.

25

PORSCHEN, STEFAN. "ON RECTANGULAR COVERING PROBLEMS." International Journal of Computational Geometry & Applications 19, no. 04 (2009): 325–40. http://dx.doi.org/10.1142/s0218195909002988.

Повний текст джерела

Анотація:

Many applications like image processing, data compression or pattern recognition require a covering of a set of n points most often located in the (discrete) plane by rectangles due to specific cost constraints. In this paper we provide exact dynamic programming algorithms for covering point sets by regular rectangles, that have to obey certain boundary conditions, namely all rectangles must have lengths of at least k, which is a prescribed problem parameter. The concrete objective function underlying our optimization problem is the sum of area, circumference and a constant over all rectangles

Стилі APA, Harvard, Vancouver, ISO та ін.

26

Agafonov, Anton, and Vladislav Myasnikov. "Method for Reliable Shortest Path Determination in Stochastic Networks using Parametrically Defined Stable Probability Distributions." SPIIRAS Proceedings 18, no. 3 (2019): 558–82. http://dx.doi.org/10.15622/sp.2019.18.3.557-581.

Повний текст джерела

Анотація:

An increase in the number of vehicles, especially in large cities, and inability of the existing road infrastructure to distribute transport flows, leads to a higher congestion level in transport networks. This problem makes the solution to navigational problems more and more important. Despite the popularity of these tasks, many existing commercial systems find a route in deterministic networks, not taking into account the time-dependent and stochastic properties of traffic flows, i.e. travel time of road links is considered as constant. This paper addresses the reliable routing problem in st

Стилі APA, Harvard, Vancouver, ISO та ін.

27

Campbell, Kayleigh, Laura Staugler, and Andrea Arnold. "Estimating Time-Varying Applied Current in the Hodgkin-Huxley Model." Applied Sciences 10, no. 2 (2020): 550. http://dx.doi.org/10.3390/app10020550.

Повний текст джерела

Анотація:

The classic Hodgkin-Huxley model is widely used for understanding the electrophysiological dynamics of a single neuron. While applying a low-amplitude constant current to the system results in a single voltage spike, it is possible to produce multiple voltage spikes by applying time-varying currents, which may not be experimentally measurable. The aim of this work is to estimate time-varying applied currents of different deterministic forms given noisy voltage data. In particular, we utilize an augmented ensemble Kalman filter with parameter tracking to estimate four different time-varying app

Стилі APA, Harvard, Vancouver, ISO та ін.

28

Boje, Edward. "Representation of simulation errors in single step methods using state dependent noise." MATEC Web of Conferences 347 (2021): 00001. http://dx.doi.org/10.1051/matecconf/202134700001.

Повний текст джерела

Анотація:

The local error of single step methods is modelled as a function of the state derivative multiplied by bias and zero-mean white noise terms. The deterministic Taylor series expansion of the local error depends on the state derivative meaning that the local error magnitude is zero in steady state and grows with the rate of change of the state vector. The stochastic model of the local error may include a constant, “catch-all” noise term. A continuous time extension of the local error model is developed and this allows the original continuous time state differential equation to be represented by

Стилі APA, Harvard, Vancouver, ISO та ін.

29

Bannai, Hideo, Travis Gagie, Gary Hoppenworth, Simon J. Puglisi, and Luís M. S. Russo. "More Time-Space Tradeoffs for Finding a Shortest Unique Substring." Algorithms 13, no. 9 (2020): 234. http://dx.doi.org/10.3390/a13090234.

Повний текст джерела

Анотація:

We extend recent results regarding finding shortest unique substrings (SUSs) to obtain new time-space tradeoffs for this problem and the generalization of finding k-mismatch SUSs. Our new results include the first algorithm for finding a k-mismatch SUS in sublinear space, which we obtain by extending an algorithm by Senanayaka (2019) and combining it with a result on sketching by Gawrychowski and Starikovskaya (2019). We first describe how, given a text T of length n and m words of workspace, with high probability we can find an SUS of length L in O(n(L/m)logL) time using random access to T, o

Стилі APA, Harvard, Vancouver, ISO та ін.

30

FERREIRA, AFONSO, and NICOLAS SCHABANEL. "A RANDOMIZED BSP/CGM ALGORITHM FOR THE MAXIMAL INDEPENDENT SET PROBLEM." Parallel Processing Letters 09, no. 03 (1999): 411–22. http://dx.doi.org/10.1142/s0129626499000384.

Повний текст джерела

Анотація:

This paper presents a randomized parallel algorithm for the Maximal Independent Set problem. Our algorithm uses a BSPlike computer with p processors and requires that [Formula: see text] for a graph with n vertices and m edges. Under this scalability assumption, and after a preprocessing phase, it computes a maximal independent set after O( log p) communication rounds, with high probability, each round requiring linear computation time [Formula: see text]. The preprocessing phase is deterministic and important in order to ensure that degree computations can be implemented efficiently. For this

Стилі APA, Harvard, Vancouver, ISO та ін.

31

BARLOW, MARTIN T., JIAN DING, ASAF NACHMIAS, and YUVAL PERES. "The Evolution of the Cover Time." Combinatorics, Probability and Computing 20, no. 3 (2011): 331–45. http://dx.doi.org/10.1017/s0963548310000489.

Повний текст джерела

Анотація:

The cover time of a graph is a celebrated example of a parameter that is easy to approximate using a randomized algorithm, but for which no constant factor deterministic polynomial time approximation is known. A breakthrough due to Kahn, Kim, Lovász and Vu [25] yielded a (log logn)2 polynomial time approximation. We refine the upper bound of [25], and show that the resulting bound is sharp and explicitly computable in random graphs. Cooper and Frieze showed that the cover time of the largest component of the Erdős–Rényi random graph G(n, c/n) in the supercritical regime with c > 1 fixed, is

Стилі APA, Harvard, Vancouver, ISO та ін.

32

Arsenault, Richard, and Pascal Côté. "Analysis of the effects of biases in ensemble streamflow prediction (ESP) forecasts on electricity production in hydropower reservoir management." Hydrology and Earth System Sciences 23, no. 6 (2019): 2735–50. http://dx.doi.org/10.5194/hess-23-2735-2019.

Повний текст джерела

Анотація:

Abstract. This paper presents an analysis of the effects of biased extended streamflow prediction (ESP) forecasts on three deterministic optimization techniques implemented in a simulated operational context with a rolling horizon test bed for managing a cascade of hydroelectric reservoirs and generating stations in Québec, Canada. The observed weather data were fed to the hydrological model, and the synthetic streamflow subsequently generated was considered to be a proxy for the observed inflow. A traditional, climatology-based ESP forecast approach was used to generate ensemble streamflow sc

Стилі APA, Harvard, Vancouver, ISO та ін.

33

Sergi, Alessandro, Gabriel Hanna, Roberto Grimaudo, and Antonino Messina. "Quasi-Lie Brackets and the Breaking of Time-Translation Symmetry for Quantum Systems Embedded in Classical Baths." Symmetry 10, no. 10 (2018): 518. http://dx.doi.org/10.3390/sym10100518.

Повний текст джерела

Анотація:

Many open quantum systems encountered in both natural and synthetic situations are embedded in classical-like baths. Often, the bath degrees of freedom may be represented in terms of canonically conjugate coordinates, but in some cases they may require a non-canonical or non-Hamiltonian representation. Herein, we review an approach to the dynamics and statistical mechanics of quantum subsystems embedded in either non-canonical or non-Hamiltonian classical-like baths which is based on operator-valued quasi-probability functions. These functions typically evolve through the action of quasi-Lie b

Стилі APA, Harvard, Vancouver, ISO та ін.

34

Dalzell, Alexander M., Aram W. Harrow, Dax Enshan Koh, and Rolando L. La Placa. "How many qubits are needed for quantum computational supremacy?" Quantum 4 (May 11, 2020): 264. http://dx.doi.org/10.22331/q-2020-05-11-264.

Повний текст джерела

Анотація:

Quantum computational supremacy arguments, which describe a way for a quantum computer to perform a task that cannot also be done by a classical computer, typically require some sort of computational assumption related to the limitations of classical computation. One common assumption is that the polynomial hierarchy (PH) does not collapse, a stronger version of the statement that P≠NP, which leads to the conclusion that any classical simulation of certain families of quantum circuits requires time scaling worse than any polynomial in the size of the circuits. However, the asymptotic nature of

Стилі APA, Harvard, Vancouver, ISO та ін.

35

Khoshjahan, Yazdan. "A Study of Resource-Constrained Project Optimization with Discounted Weighted Earliness-Tardiness Penalty Costs." Advanced Materials Research 488-489 (March 2012): 898–903. http://dx.doi.org/10.4028/www.scientific.net/amr.488-489.898.

Повний текст джерела

Анотація:

This research consider a project scheduling problem with the object of minimizing weighted earliness-tardiness penalty costs, subject to precedence relations among the activities and resource-constrained. Project activities are assumed to have a known deterministic due date, a unit earliness as well as a unit tardiness penalty cost and constant renewable resource requirements. The objective is to schedule the activities in order to minimize the total weighted earliness–tardiness penalty cost of the project subject to the finish–start precedence constraints and the constant renewable resource a

Стилі APA, Harvard, Vancouver, ISO та ін.

36

Su, Huanyin, Feng Shi, Guangming Xu, Jin Qin, and Xinghua Shan. "Schedule-Based Passenger Assignment for High-Speed Rail Networks considering the Ticket-Booking Process." Mathematical Problems in Engineering 2016 (2016): 1–15. http://dx.doi.org/10.1155/2016/1650839.

Повний текст джерела

Анотація:

This paper proposes a schedule-based passenger assignment method for high-speed rail networks considering the ticket-booking process. Passengers book tickets to reserve seats during the presale period in high-speed rail systems and passengers on trains are determined during the ticket-booking process. The ticket-booking process is modeled as a continuous and deterministic predecision process. A solution algorithm is designed using the discretization of the continuous process by partitioning the ticket-booking time and the optimal paths remain constant in any partition interval. Finally, an app

Стилі APA, Harvard, Vancouver, ISO та ін.

37

Abbad, Brahim, and Bjørn Ursin. "High-resolution bootstrapped differential semblance." GEOPHYSICS 77, no. 3 (2012): U39—U47. http://dx.doi.org/10.1190/geo2011-0231.1.

Повний текст джерела

Анотація:

We formulated two coherency measures, based on the bootstrapped differential semblance (BDS) estimator, that offered higher resolution in parameter tracking than did standard normalized differential semblance. Bootstrapping is a statistical resampling procedure used to infer estimates of standard errors and confidence intervals from data samples for which the statistical properties are unattainable via simple means, or when the probability density function is unkown or difficult to estimate. The first proposed estimator was based on a deterministic sorting of original offset traces by alternat

Стилі APA, Harvard, Vancouver, ISO та ін.

38

Koehler, Fulton, and M. Turhan Taner. "The use of the conjugate‐gradient algorithm in the computation of predictive deconvolution operators." GEOPHYSICS 50, no. 12 (1985): 2752–58. http://dx.doi.org/10.1190/1.1441895.

Повний текст джерела

Анотація:

A number of excellent papers have been published since the introduction of deconvolution by Robinson in the middle 1950s. The application of the Wiener‐Levinson algorithm makes deconvolution a practical and vital part of today’s digital seismic data processing. We review the original formulation of deconvolution, develop the solution from another perspective, and demonstrate a general and rigorous solution that could be implemented. By “general” we mean a deterministic time‐varying and multichannel operator design, and by “rigorous” we mean the straightforward least‐squares error solution with

Стилі APA, Harvard, Vancouver, ISO та ін.

39

Guruswami, Venkatesan, and Chaoping Xing. "Optimal Rate List Decoding over Bounded Alphabets Using Algebraic-geometric Codes." Journal of the ACM 69, no. 2 (2022): 1–48. http://dx.doi.org/10.1145/3506668.

Повний текст джерела

Анотація:

We give new constructions of two classes of algebraic code families that are efficiently list decodable with small output list size from a fraction 1-R-ε of adversarial errors, where R is the rate of the code, for any desired positive constant ε. The alphabet size depends only ε and is nearly optimal. The first class of codes are obtained by folding algebraic-geometric codes using automorphisms of the underlying function field. The second class of codes are obtained by restricting evaluation points of an algebraic-geometric code to rational points from a subfield . In both cases, we develop a

Стилі APA, Harvard, Vancouver, ISO та ін.

40

Kohútka, Lukáš, Lukáš Nagy, and Viera Stopjaková. "Hardware Dynamic Memory Manager for Hard Real-Time Systems." Annals of Emerging Technologies in Computing 3, no. 4 (2019): 48–70. http://dx.doi.org/10.33166/aetic.2019.04.005.

Повний текст джерела

Анотація:

This paper presents novel hardware architecture of dynamic memory manager providing memory allocation and deallocation operations that are suitable for hard real-time and safety-critical systems due to very high determinism of these operations. The proposed memory manager implements Worst-Fit algorithm for selection of suitable free block of memory that can be used by the external environment, e.g. CPU. The deterministic timing of the memory allocation and deallocation operations is essential for hard real-time systems. The proposed memory manager performs these operations in nearly constant t

Стилі APA, Harvard, Vancouver, ISO та ін.

41

Hou, Jing, Yan Yang, He He, and Tian Gao. "Adaptive Dual Extended Kalman Filter Based on Variational Bayesian Approximation for Joint Estimation of Lithium-Ion Battery State of Charge and Model Parameters." Applied Sciences 9, no. 9 (2019): 1726. http://dx.doi.org/10.3390/app9091726.

Повний текст джерела

Анотація:

An accurate state of charge (SOC) estimation is vital for the safe operation and efficient management of lithium-ion batteries. At present, the extended Kalman filter (EKF) can accurately estimate the SOC under the condition of a precise battery model and deterministic noise statistics. However, in practical applications, the battery characteristics change with different operating conditions and the measurement noise statistics may vary with time, resulting in nonoptimal and even unreliable estimation of SOC by EKF. To improve the SOC estimation accuracy under uncertain measurement noise stati

Стилі APA, Harvard, Vancouver, ISO та ін.

42

Wu, Liangshun, and Hengjin Cai. "Novel Stream Ciphering Algorithm for Big Data Images Using Zeckendorf Representation." Wireless Communications and Mobile Computing 2021 (October 21, 2021): 1–19. http://dx.doi.org/10.1155/2021/4637876.

Повний текст джерела

Анотація:

Big data is a term used for very large data sets. Digital equipment produces vast amounts of images every day; the need for image encryption is increasingly pronounced, for example, to safeguard the privacy of the patients’ medical imaging data in cloud disk. There is an obvious contradiction between the security and privacy and the widespread use of big data. Nowadays, the most important engine to provide confidentiality is encryption. However, block ciphering is not suitable for the huge data in a real-time environment because of the strong correlation among pixels and high redundancy; strea

Стилі APA, Harvard, Vancouver, ISO та ін.

43

Alfonso, L. "An algorithm for the numerical solution of the multivariate master equation for stochastic coalescence." Atmospheric Chemistry and Physics Discussions 15, no. 8 (2015): 12213–40. http://dx.doi.org/10.5194/acpd-15-12213-2015.

Повний текст джерела

Анотація:

Abstract. In cloud modeling studies, the time evolution of droplet size distributions due to collision-coalescence events is usually modeled with the kinetic collection equation (KCE) or Smoluchowski coagulation equation. However, the KCE is a deterministic equation with no stochastic fluctuations or correlations. Therefore, the full stochastic description of cloud droplet growth in a coalescing system must be obtained from the solution of the multivariate master equation, which models the evolution of the state vector for the number of droplets of a given mass. Unfortunately, due to its compl

Стилі APA, Harvard, Vancouver, ISO та ін.

44

Alfonso, L. "An algorithm for the numerical solution of the multivariate master equation for stochastic coalescence." Atmospheric Chemistry and Physics 15, no. 21 (2015): 12315–26. http://dx.doi.org/10.5194/acp-15-12315-2015.

Повний текст джерела

Анотація:

Abstract. In cloud modeling studies, the time evolution of droplet size distributions due to collision–coalescence events is usually modeled with the Smoluchowski coagulation equation, also known as the kinetic collection equation (KCE). However, the KCE is a deterministic equation with no stochastic fluctuations or correlations. Therefore, the full stochastic description of cloud droplet growth in a coalescing system must be obtained from the solution of the multivariate master equation, which models the evolution of the state vector for the number of droplets of a given mass. Unfortunately,

Стилі APA, Harvard, Vancouver, ISO та ін.

45

Limon-Cantu, David, and Vicente Alarcon-Aquino. "Multiresolution dendritic cell algorithm for network anomaly detection." PeerJ Computer Science 7 (October 19, 2021): e749. http://dx.doi.org/10.7717/peerj-cs.749.

Повний текст джерела

Анотація:

Anomaly detection in computer networks is a complex task that requires the distinction of normality and anomaly. Network attack detection in information systems is a constant challenge in computer security research, as information systems provide essential services for enterprises and individuals. The consequences of these attacks could be the access, disclosure, or modification of information, as well as denial of computer services and resources. Intrusion Detection Systems (IDS) are developed as solutions to detect anomalous behavior, such as denial of service, and backdoors. The proposed mo

Стилі APA, Harvard, Vancouver, ISO та ін.

46

Plaskura, Paweł. "MODELLING OF FORGETTING CURVES IN EDUCATIONAL E-ENVIRONMENT." Information Technologies and Learning Tools 71, no. 3 (2019): 1. http://dx.doi.org/10.33407/itlt.v71i3.2368.

Повний текст джерела

Анотація:

Modelling of the didactical process by using educational network needs network representation of learning and forgetting curves known from the literature. The learning and forgetting curves are the solution of differential equations. The differential equations can be represented in the form of a network of connected elements in a similar way to the electrical circuits and represented in the form of an intuitive schematic. The network can be simulated using a microsystems simulator. Such an approach enables the easy creation of the macro models and their analysis. It enables the use of many adv

Стилі APA, Harvard, Vancouver, ISO та ін.

47

Chakrabarty, Anindya, Zongwei Luo, Rameshwar Dubey, and Shan Jiang. "A theoretical model of jump diffusion-mean reversion." Business Process Management Journal 23, no. 3 (2017): 537–54. http://dx.doi.org/10.1108/bpmj-01-2016-0005.

Повний текст джерела

Анотація:

Purpose The purpose of this paper is to develop a theoretical model of a jump diffusion-mean reversion constant proportion portfolio insurance strategy under the presence of transaction cost and stochastic floor as opposed to the deterministic floor used in the previous literatures. Design/methodology/approach The paper adopts Merton’s jump diffusion (JD) model to simulate the price path followed by risky assets and the CIR mean reversion model to simulate the path followed by the short-term interest rate. The floor of the CPPI strategy is linked to the stochastic process driving the value of

Стилі APA, Harvard, Vancouver, ISO та ін.

48

LAWLOR, DAVID, YANG WANG, and ANDREW CHRISTLIEB. "ADAPTIVE SUB-LINEAR TIME FOURIER ALGORITHMS." Advances in Adaptive Data Analysis 05, no. 01 (2013): 1350003. http://dx.doi.org/10.1142/s1793536913500039.

Повний текст джерела

Анотація:

We present a new deterministic algorithm for the sparse Fourier transform problem, in which we seek to identify k ≪ N significant Fourier coefficients from a signal of bandwidth N. Previous deterministic algorithms exhibit quadratic runtime scaling, while our algorithm scales linearly with k in the average case. Underlying our algorithm are a few simple observations relating the Fourier coefficients of time-shifted samples to unshifted samples of the input function. This allows us to detect when aliasing between two or more frequencies has occurred, as well as to determine the value of unalias

Стилі APA, Harvard, Vancouver, ISO та ін.

49

Ivanyos, Gábor, Marek Karpinski, and Nitin Saxena. "Deterministic Polynomial Time Algorithms for Matrix Completion Problems." SIAM Journal on Computing 39, no. 8 (2010): 3736–51. http://dx.doi.org/10.1137/090781231.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

50

BONFANTE, G., A. CICHON, J. Y. MARION, and H. TOUZET. "Algorithms with polynomial interpretation termination proof." Journal of Functional Programming 11, no. 1 (2001): 33–53. http://dx.doi.org/10.1017/s0956796800003877.

Повний текст джерела

Анотація:

We study the effect of polynomial interpretation termination proofs of deterministic (resp. non-deterministic) algorithms defined by con uent (resp. non-con uent) rewrite systems over data structures which include strings, lists and trees, and we classify them according to the interpretations of the constructors. This leads to the definition of six function classes which turn out to be exactly the deterministic (resp. non-deterministic) polynomial time, linear exponential time and linear doubly exponential time computable functions when the class is based on con uent (resp. non-con uent) rewri

Стилі APA, Harvard, Vancouver, ISO та ін.

Ми пропонуємо знижки на всі преміум-плани для авторів, чиї праці увійшли до тематичних добірок літератури. Зв'яжіться з нами, щоб отримати унікальний промокод!