• Aucun résultat trouvé

[PDF] Top 20 On the Complexity of Umbra and Penumbra

Has 10000 "On the Complexity of Umbra and Penumbra" found on our website. Below are the top 20 most common "On the Complexity of Umbra and Penumbra".

On the Complexity of Umbra and Penumbra

On the Complexity of Umbra and Penumbra

... Unité de recherche INRIA Lorraine LORIA, Technopôle de Nancy-Brabois - Campus scientifique 615, rue du Jardin Botanique - BP 101 - 54602 Villers-lès-Nancy Cedex France Unité de recherche[r] ... Voir le document complet

32

Lower and Upper Bounds on the Randomness Complexity of Private Computations of AND

Lower and Upper Bounds on the Randomness Complexity of Private Computations of AND

... compute the value of f (x). The protocol operates in ...coins, and then sends messages to the other players (messages are sent over private channels so that other than the ... Voir le document complet

22

On the complexity of partial derivatives

On the complexity of partial derivatives

... consider the dimension of the set of partial derivatives as a computational problem and provide the first results (that we are aware of) on its ...above, the ... Voir le document complet

19

The Shortcut Problem - Complexity and Algorithms

The Shortcut Problem - Complexity and Algorithms

... ILP-Formulation. The number of variables and constraints of the following integer linear program (LSP) is cubic in |V ...|. The model exhibits two types of ...if ... Voir le document complet

30

The complexity of tropical graph homomorphisms.

The complexity of tropical graph homomorphisms.

... Recall the dichotomy theorem for list homomorphism problems of Feder, Hell and Huang (Theorem ...bipartite and its complement is a circular arc graph, otherwise ...Alternatively, the ... Voir le document complet

27

ON THE COMPLEXITY AND VOLUME OF HYPERBOLIC 3-MANIFOLDS

ON THE COMPLEXITY AND VOLUME OF HYPERBOLIC 3-MANIFOLDS

... case of one rectangle τ . Suppose that the edge y ∈ Λ \ T represents the ele- ment g = ng 1 + mg 2 ∈ G σ ...A and gA be vertices of f ( e T ) belonging to S t 0 connected by a geodesic ... Voir le document complet

23

On the Complexity of Robust Stable Marriage

On the Complexity of Robust Stable Marriage

... I of π F 2 is the construction of the pref- erence ...using the rotation poset created above, we can construct incom- plete preference lists for the men and ...create ... Voir le document complet

15

On the Uncontended Complexity of Anonymous Consensus

On the Uncontended Complexity of Anonymous Consensus

... used, the algorithm is trivially interval-solo-fast. By Lemma 9, the algorithm satisfies the Agreement property of ...in the following that the Solo execution property is also ... Voir le document complet

14

On the Complexity and Volume of Hyperbolic 3-Manifolds

On the Complexity and Volume of Hyperbolic 3-Manifolds

... represents the total number of triangles in ...not) and let E be a family of elementary subgroups of ...action of G such that the vertex stabilizers are elements of ... Voir le document complet

21

The complexity of signed and edge-coloured graph homomorphisms.

The complexity of signed and edge-coloured graph homomorphisms.

... H, the list homomorphism problem for fixed H, denoted ListHom(H), is defined over inputs consisting of pairs (G, L) where G is a graph and L is a list function assigning a list L(v) ⊆ V (H) of ... Voir le document complet

21

On the Complexity of Concurrent Multiset Rewriting

On the Complexity of Concurrent Multiset Rewriting

... implementation of an autonomic system offers several challenges that can not be tackled at ...distinguish the development of the low-level machinery from the definition of ... Voir le document complet

21

On the Complexity of A/B Testing

On the Complexity of A/B Testing

... algorithm, the log probability of error is approximately a linear function of the number of samples, with a slope close to −1/κ, where κ is the ...visualize the gain in ... Voir le document complet

24

On the Complexity of Global Constraint Satisfaction

On the Complexity of Global Constraint Satisfaction

... Sudan and Trevisan [KST97] established a classification theorem for minimization versions of boolean constraint satisfaction ...problems. The complexity of approximation of Min ... Voir le document complet

21

On the communication complexity of multilateral trading

On the communication complexity of multilateral trading

... affect the overall number of deals ...accept, and reject, to be able to communicate a proposed deal to (a set of) potential trading partners and to either accept or reject such a ... Voir le document complet

8

Complexity of the satisfactory partition problem

Complexity of the satisfactory partition problem

... graph, complexity, polynomial algorithm, NP-complete. 1 Introduction Gerber and Kobler introduced in [GK98, GK00] the problem of deciding if a given graph has a vertex partition into two ... Voir le document complet

13

On the Complexity of Concurrent Multiset Rewriting

On the Complexity of Concurrent Multiset Rewriting

... Conclusion and Future Work In this paper, we have shown that, through a static analysis of the reaction con- ditions, concurrent multiset rewriting using a rule of arity k can be solved in a ... Voir le document complet

18

The Complexity of Optimal Mechanism Design

The Complexity of Optimal Mechanism Design

... computing the optimal auction encoding C(I) for an instance I is assumed to be ...when the auction C(I) is executed, then somebody (either the auctioneer, or the bidders, or both) need to do ... Voir le document complet

24

The complexity of optimal mechanism design

The complexity of optimal mechanism design

... Given that optimal mechanisms have no apparent structure, even in the simple case of an additive bidder with independent values for the items, the main challenge [r] ... Voir le document complet

64

The complexity of Markov decision processes

The complexity of Markov decision processes

... All three variants of the problem (finite horizon, in finite horizon discounted, and infinite horizon average cost) were known to be solvable in polynomial time.. by dynamlic prog[r] ... Voir le document complet

12

On the smoothed complexity of convex hulls

On the smoothed complexity of convex hulls

... comparison of our smoothed complexity bound of Theorem 7 and two lower bounds, where the initial points are placed respectively at the vertices of a unit-size n-gon ... Voir le document complet

16

Show all 10000 documents...