• Aucun résultat trouvé

OPTIMAL ALGORITHM

An Optimal Algorithm for Enumerating Connected Convex Subgraphs in Acyclic Digraphs

An Optimal Algorithm for Enumerating Connected Convex Subgraphs in Acyclic Digraphs

... {emmanuel.casseau}@irisa.fr Abstract Reconfigurable computing system is emerging as an important computing system for satisfying the present and future computing demands in performance and flexibility. Extensible ...

8

An asymptotically optimal algorithm for pickup and delivery problems

An asymptotically optimal algorithm for pickup and delivery problems

... Structure of the paper. This paper is structured as follows. In section II we provide some background on the Euclidean Bipartite Matching Problem and on some notions in probabil- ity and group theory. We formally state ...

8

A Minimax Optimal Algorithm for Crowdsourcing

A Minimax Optimal Algorithm for Crowdsourcing

... The results are shown in Tables 1 and 2, where the best results are indicated in bold. The spectral algorithms RoE, EoR and GKM tend to be outperformed by the other algorithms. To perform well, GKM needs θ 1 to be ...

10

An Almost Optimal Algorithm for Computing Nonnegative Rank

An Almost Optimal Algorithm for Computing Nonnegative Rank

... an algorithm that is exponential in n and m even for constant ...main algorithm. In fact, the algorithm that we obtain is nearly optimal (under the exponential time hypothesis) since an ...

19

A nearly optimal algorithm to decompose binary forms

A nearly optimal algorithm to decompose binary forms

... the algorithm proposed in the conference version of this paper (Bender et ...2016, Algorithm 3), the correctness of our algorithms relied on this ...

41

A minimax and asymptotically optimal algorithm for stochastic bandits

A minimax and asymptotically optimal algorithm for stochastic bandits

... ++ algorithm is both minimax- and asymptotically-optimal for the exponential distribution families described in Section 2 ...this algorithm requires the horizon T as a parameter: to keep the proofs ...

16

Composable core-sets for determinant maximization: A simple near-optimal algorithm

Composable core-sets for determinant maximization: A simple near-optimal algorithm

... almost optimal approximate composable ...their algorithm is almost ...the algorithm requires an explicit representation of the point set, which is not present for many DPP applications; a common case ...

19

Small An optimal algorithm to generate tilings.

Small An optimal algorithm to generate tilings.

... Meet-irreducible elements The meet-irreducible elements of the lattice are those whose height function admits exactly one local maximum in the interior of D. For each vertex in the interior of D, one can compute the ...

15

Optimal Multistage Algorithm for Adjoint Computation

Optimal Multistage Algorithm for Adjoint Computation

... an optimal algorithm for this problem when there are two levels of checkpoints, in memory and on ...Previously, optimal algorithms for adjoint computations were known only for a single level of ...

36

An Optimal Broadcast Algorithm for Content-Addressable Networks

An Optimal Broadcast Algorithm for Content-Addressable Networks

... of optimal broadcast in a CAN is that, as a CAN is a P2P network, each peer only has information about the zone it manages, and the zones managed by its ...an optimal algorithm based on sub-spaces, ...

16

Algorithm engineering for optimal alignment of protein structure distance matrices

Algorithm engineering for optimal alignment of protein structure distance matrices

... edges with negative objective function score, in this case we do not know the cardinality of the path beforehand. If the weight of the lightest decreasing path +1 is smaller than x ik , we identified a violated ...

15

Overrelaxed Sinkhorn-Knopp Algorithm for Regularized Optimal Transport

Overrelaxed Sinkhorn-Knopp Algorithm for Regularized Optimal Transport

... Introduction Optimal Transport is an efficient and flexible tool to compare two probability distributions which has been popularized in the computer vision community in the context of discrete histograms [Rub- ner ...

10

Computation of conjugate times in smooth optimal control: the COTCOT algorithm

Computation of conjugate times in smooth optimal control: the COTCOT algorithm

... the algorithm of §II. Indeed, any optimal control is smooth outside isolated points called Π-singularities where an instantaneous rotation of angle pi occurs ...previous algorithm holds. Indeed, any ...

6

Optimal Real-Time Scheduling Algorithm for Wireless Sensors with Regenerative Energy

Optimal Real-Time Scheduling Algorithm for Wireless Sensors with Regenerative Energy

... (EA-DVFS) algorithm that aims to exploit the slack time as much as possible to reduce the deadline miss ...proposed algorithm only considers the currect task instead of take into account all tasks in the ...

21

Optimal Spectral Histology of Human Normal Colon by Genetic Algorithm

Optimal Spectral Histology of Human Normal Colon by Genetic Algorithm

... 178 Optimal Spectral Histology of Human Normal Colon by Genetic Algorithm Ihsen FARAH 1,2 , Thi Nguyet Que NGUYEN 1,2 , Audrey GROH 3 , Dominique GUENOT 3 , Pierre JEANNESSON 1,2 ,Cyril GOBINET 1,2 ...

3

Gradient-Based Algorithm with Spatial Regularization for Optimal Sensor Placement

Gradient-Based Algorithm with Spatial Regularization for Optimal Sensor Placement

... ABSTRACT In this paper, we are interested in optimal sensor placement for signal extraction. Recently, a new criterion based on out- put signal to noise ratio has been proposed for sensor place- ment. However, to ...

6

An Optimal Broadcast Algorithm for Content-Addressable Networks -- Extended Version

An Optimal Broadcast Algorithm for Content-Addressable Networks -- Extended Version

... other algorithm achieves those two goals in the context of ...an algorithm that sends exactly one message per recipient without building a global view of the ...this algorithm. Finally, we show the ...

20

Optimal Real-Time Scheduling Algorithm for Wireless Sensors with Regenerative Energy

Optimal Real-Time Scheduling Algorithm for Wireless Sensors with Regenerative Energy

... an optimal real-time scheduling framework with speed stretching, namely Energy Guarantee Dynamic Voltage and Frequency Scaling (EG-DVFS), that jointly accounts for the timing constraints and the energy state ...

12

Splitting algorithm for DMT optimal cooperative MAC protocols in wireless mesh networks

Splitting algorithm for DMT optimal cooperative MAC protocols in wireless mesh networks

... To cite this version : Escrig, Benoît Splitting algorithm for DMT optimal cooperative MAC protocols in wireless mesh networks. (2011) Physical Communication, 4. pp.218-226. ISSN 1874-4907 㩷 O pen A rchive T ...

10

Optimal Step-Size Constant Modulus Algorithm

Optimal Step-Size Constant Modulus Algorithm

... Index Terms Adaption coefficient, blind equalization, CMA, exact line search, SISO and SIMO channels. I. I NTRODUCTION An important problem in digital communications is the recovery of the data symbols transmitted ...

11

Show all 3348 documents...

Sujets connexes