• Aucun résultat trouvé

[PDF] Top 20 The automatic complexity analysis of divide-and-conquer algorithms

Has 10000 "The automatic complexity analysis of divide-and-conquer algorithms" found on our website. Below are the top 20 most common "The automatic complexity analysis of divide-and-conquer algorithms".

The automatic complexity analysis of divide-and-conquer algorithms

The automatic complexity analysis of divide-and-conquer algorithms

... 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] ... Voir le document complet

16

Deriving divide-and-conquer dynamic programming algorithms using solver-aided transformations

Deriving divide-and-conquer dynamic programming algorithms using solver-aided transformations

... namic analysis to discover a program’s access pattern and learn a decomposition that can be used to generate a divide- and-conquer ...implementation. The two methods are comple- ... Voir le document complet

21

Divide and Conquer Symmetric Tridiagonal Eigensolver for Multicore Architectures

Divide and Conquer Symmetric Tridiagonal Eigensolver for Multicore Architectures

... sequential and create a join operation: the Compute deflation and the ...1% of the overall computational time), and they are local to each merging ...deflation and ... Voir le document complet

11

Low complexity adaptive algorithms for Principal and Minor Component Analysis

Low complexity adaptive algorithms for Principal and Minor Component Analysis

... in the sim- ulation results that can be explained by the fact that it allows us to better avoid the local ...as Automatic Selection GOPAST (AS-GOPAST). Hybrid criterion: It consists of ... Voir le document complet

12

Towards efficient and fault-tolerant optical networks : complexity and algorithms

Towards efficient and fault-tolerant optical networks : complexity and algorithms

... properties of optical networks: fault-tolerance and ...amounts of data and any failure can result in the loss of considerable traffic and the disruption of ... Voir le document complet

225

Complexity results and exact algorithms for robust knapsack problems

Complexity results and exact algorithms for robust knapsack problems

... one of its variants [4]. The outputs of these deterministic models, however, suffer from imprecisions that make their practi- cal implementation almost impossible in some cases ...from the ... Voir le document complet

2

Complexity Estimates for Two Uncoupling Algorithms

Complexity Estimates for Two Uncoupling Algorithms

... to the differential system Y 0 = M Y , a classical tool of differential algebra is the map δ, defined at a matrix or a row vector u by δ(u) = uM + u 0 ...objective of both CVM and DBZ, ... Voir le document complet

9

Nonmonotonic Reasoning: from Complexity to Algorithms

Nonmonotonic Reasoning: from Complexity to Algorithms

... purpose of this paper is to outline various results regarding the computational complexity and the algorithms of nonmonotonic entailment in di erent coherence- based ...E ... Voir le document complet

31

Graphical Models: Queries, Complexity, Algorithms

Graphical Models: Queries, Complexity, Algorithms

... most of all the algorithms we have described above to solve the WCSP/CFN problem, which is essentially equivalent (up lo a − log transform and bounded precision description of ... Voir le document complet

23

Optimisation of electrical network configuration: complexity and algorithms for ring topologies

Optimisation of electrical network configuration: complexity and algorithms for ring topologies

... solution and complete it with α(w) = 0) with same load reserve and ...In the second case, w (w 0 on Figure 3) has no successor in W ...w and reaching a consumer node, and thus ... Voir le document complet

16

The Multiple Steiner TSP with order constraints: complexity and optimization algorithms

The Multiple Steiner TSP with order constraints: complexity and optimization algorithms

... On the first subproblem, y e ∗ is fixed to 0, on the second y e ∗ is fixed to ...kind of branching does not change the pricing since it does not fix specific path ...level of the ... Voir le document complet

12

Automatic Generation of Detection Algorithms for Design Defects

Automatic Generation of Detection Algorithms for Design Defects

... overcome the limitations of previ- ous work on the detection of design defects by defining these defects synthetically and by generating detection algorithms ...enhance ... Voir le document complet

4

The Average case analysis of algorithms : counting and generating functions

The Average case analysis of algorithms : counting and generating functions

... 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] ... Voir le document complet

122

Contraction maps and applications to the analysis of iterative algorithms

Contraction maps and applications to the analysis of iterative algorithms

... Contraction maps and Banach's Fixed Point Theorem are very important tools for bound- ing the running time of a big class of iterative algorithms used to solve non-convex[r] ... Voir le document complet

107

Analytic analysis of algorithms

Analytic analysis of algorithms

... 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] ... Voir le document complet

29

Development and validation of algorithms for automatic and real-time characterization of drowsiness

Development and validation of algorithms for automatic and real-time characterization of drowsiness

... find the strongest correlations with the PSG-based LoD which also combines several parameters ...tivity, and slow eye ...on the behavior of the individual or on the ... Voir le document complet

144

Automatic music classification using boosting algorithms and auditory features

Automatic music classification using boosting algorithms and auditory features

... \‘Ve use timbrai anci rhythmical features and ADABOOST to builci a state-of the-art classifier for music genre, described in Section 4.3, and in the following section we show the resuits[r] ... Voir le document complet

128

Automatic derivation of concepts based on the analysis of identifiers

Automatic derivation of concepts based on the analysis of identifiers

... Case and underscore concatenations, lead to the devel- opment of a family of algorithms to segment identifiers into component ...These algorithms have in common the ... Voir le document complet

88

Mathematical methods in the analysis of algorithms and data structures

Mathematical methods in the analysis of algorithms and data structures

... 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] ... Voir le document complet

72

Algorithms and lower bounds in finite automata size complexity

Algorithms and lower bounds in finite automata size complexity

... The standard conjecture that L f NL asserts that a particular nondeterministic finite automaton with a small bunch of states and just two heads that only move one-wa[r] ... Voir le document complet

99

Show all 10000 documents...