deterministic algorithms
Deterministic Algorithms for the Lovász Local Lemma
... DETERMINISTIC ALGORITHMS FOR THE LOV ´ ASZ LOCAL LEMMA ∗ KARTHEKEYAN CHANDRASEKARAN † , NAVIN GOYAL ‡ , AND BERNHARD HAEUPLER § Abstract. The Lov´ asz local lemma (LLL) [P. Erd˝ os and L. Lov´ asz, ...
25
Deterministic algorithms for the low rank approximation of matrices
... Low rank approximations using the symmetric eigenvalue decomposition Objectives and key idea Formulation of the matrix eigenvalue problem Standard algorithm for the Hermitian eigendecomp[r] ...
115
2017 — Application of metaheuristic and deterministic algorithms for aircraft reference trajectory optimization
... Many algorithms take advantage of the aircraft Equations of motion (EoM) to simulate the aircraft as a point-mass ...optimization algorithms such as dynamic programming, shortest path algorithms, and ...
293
Deterministic algorithms for the Lovász Local Lemma
... The running time to find the suitable table T using the method of conditional proba- bilities can be computed as follows: each variable has at most D possible choices o[r] ...
36
Deterministic Recurrent Communication in Restricted Sensor Networks
... find deterministic algorithms that minimize the message complexity and, among those, algorithms that attempt to minimize the ...study deterministic oblivious and adaptive protocols for ...
18
Asynchronous Deterministic Rendezvous in Bounded Terrains
... All our considerations concern deterministic algorithms. The crucial notion is the route of the robot which is a finite polygonal path in the terrain. The adver- sary initially places a robot at some point ...
16
Deterministic and stochastic methods for molecular simulation
... L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des établissements d’enseignemen[r] ...
158
Lower bounds for non standard deterministic estimation
... Ω × Π θ r and to consider estimation rules from Ω × Π θ r , leading to the derivation of lower bounds of unbiased estimator b θ (x, θ r ) of θ. This embedding mechanism allows to transpose all the lowers bounds derived ...
6
On Lower Bounds for Non Standard Deterministic Estimation
... addressed deterministic parame- ter estimation and the situation where a closed-form of the con- ditional ...non-standard deterministic estimation, at the expense of tightness ...unknown ...
17
Asynchronous deterministic rendezvous in bounded terrains
... LIF, Universit´ e de Provence, 13453 Marseille, France. Abstract Two mobile agents (robots) have to meet in an a priori unknown bounded terrain modeled as a polygon, possibly with polygonal obstacles. Robots are modeled ...
21
Deterministic network coding by matrix completion
... The running time of this algorithm is obviously dominated by Step 2. To find such a matching M, we augment the matroid matching problem G with weights. Edges correspondi[r] ...
85
Deterministic approach to polarization mode dispersion
... One of the most challenging problems to this deterministic approach is the real- time monitoring of the PMD information. We propose an improved version of the PMD estimation technique using polarization scrambling ...
223
Conceptual Phrases and Deterministic English Parsing
... STbis chapter develops a representation for English numerals (American dialect), in the form of syntactically augmented .frames as described in the previous chalp'r. [r] ...
45
MSE lower bounds for deterministic parameter estimation
... Index Terms— Estimation, Signal detection 1. INTRODUCTION Lower bounds on the mean square error (MSE) in estimating a set of deterministic parameters from noisy observations provide the best performance of any ...
5
Monotonicity of Non-deterministic Graph Searching
... required by a q-program to win against any fugitive in G. Similarily, we define the monotone q- limited search number of a graph G, denoted by ms q (G), as the smallest number of searchers required by a monotone ...
11
Deterministic Policy Gradient Algorithms
... actor-critic algorithms are based on model-free, in- cremental, stochastic gradient updates; these methods are suitable when the model is unknown, data is plentiful and computation is the ...on ...
10
Topologically Ordered Graph Clustering via Deterministic Annealing
... 3 Deterministic Annealing The main difficulty with (organized) modularity maximization is that it is a discrete optimization ...by deterministic annealing [11]. Deterministic annealing tries to solve ...
7
Anisotropic permeability in deterministic lateral displacement arrays
... in deterministic lateral displacement arrays Rohan Vernekar, ∗a Timm Krüger, a Kevin Loutherback, b‡ Keith Morton c and David Inglis d We investigate anisotropic permeability of microfluidic deterministic ...
10
Necessary and Sufficient Conditions for Deterministic Desynchronization
... It proves that the Concurrent NRSA property indeed characterizes synchronous specifications that give deterministic asynchronous implementations when a Concurrent Incremental ASAP input [r] ...
25
Deterministic Dynamics and Cointegration of Higher Orders
... L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des établissements d’enseignemen[r] ...
35