• Aucun résultat trouvé

[PDF] Top 20 Algorithmic issues in queueing systems and combinatorial counting problems

Has 10000 "Algorithmic issues in queueing systems and combinatorial counting problems" found on our website. Below are the top 20 most common "Algorithmic issues in queueing systems and combinatorial counting problems".

Algorithmic issues in queueing systems and combinatorial counting problems

Algorithmic issues in queueing systems and combinatorial counting problems

... We extend our approach used to solve the problem of counting the number of colorings of a graph to Markov random field model and show that under certain condit[r] ... Voir le document complet

118

Treewidth: algorithmic, combinatorial, and practical aspects

Treewidth: algorithmic, combinatorial, and practical aspects

... of algorithmic applications. The key point is the fact that many problems that are NP-hard on general graphs can be solved in polynomial time on ...cover, and if it contains exactly two ... Voir le document complet

219

Data-Compression for Parametrized Counting Problems on Sparse Graphs

Data-Compression for Parametrized Counting Problems on Sparse Graphs

... of problems of ...Science and has offered a wealth of algorithmic techniques and solutions (see [12, 17, 22, 38] for related ...textbooks). In some cases, in-depth investigations ... Voir le document complet

14

Algorithmic contributions to bilevel location problems with queueing and user equilibrium : exact and semi-exact approaches

Algorithmic contributions to bilevel location problems with queueing and user equilibrium : exact and semi-exact approaches

... naturally in an environment with limited re- ...congestion in the form of maximum capacity, more elaborate models capture congestion through functional forms derived or not from queueing ...delays, ... Voir le document complet

166

Combinatorial problems in solving linear systems

Combinatorial problems in solving linear systems

... algorithm, and to be able to select a vertex of minimum degree, the elimination process should somehow be ...described in [ 73 , 95 , 96 ]. The survey by George and Liu [ 98 ] lists, inter alia, the ... Voir le document complet

41

Boltzmann Oracle for Combinatorial Systems

Boltzmann Oracle for Combinatorial Systems

... the combinatorial system into a system over generating series; (ii) compute the Jacobian matrix J ; (iii) compute J (0, 0) m , with m the ...if and only if this matrix is 0. This improves in ... Voir le document complet

15

Enriching Solutions to Combinatorial Problems via Solution Engineering

Enriching Solutions to Combinatorial Problems via Solution Engineering

... tions. In the case of optimization, an objective function, commonly related to some measure of cost or time, guides the ...search. In practice, the prerequisite of a model raises important ...uncertain ... Voir le document complet

37

Probabilistic Analysis of Counting Protocols in Large-scale Asynchronous and Anonymous Systems

Probabilistic Analysis of Counting Protocols in Large-scale Asynchronous and Anonymous Systems

... 2 and 3 depict the convergence parallel time τ ⌈N(1−δ)⌉ /n (recall that the convergence parallel time is equal to the convergence time divided by n) for both scenario, the bound τ ′ obtained from Relation (7), ... Voir le document complet

12

Grid Data Management: Open Problems and New Issues

Grid Data Management: Open Problems and New Issues

... high-level and based on semantics ...applications and data sources, possibly spanning different ...tuning and self-repairing, is critical to relieve the Grid users from administration ...security ... Voir le document complet

14

Elastic bands for nonholonomic car-like robots : algorithms and combinatorial issues.

Elastic bands for nonholonomic car-like robots : algorithms and combinatorial issues.

... 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

18

COUNTING FUNCTION OF MAGNETIC RESONANCES FOR EXTERIOR PROBLEMS

COUNTING FUNCTION OF MAGNETIC RESONANCES FOR EXTERIOR PROBLEMS

... way, in Subsec- tion ...−1 and the Dirichlet-Neumann and the Neumann-Dirichlet ...results. In Sec- tions 5 and 6, exploiting the fact that the Dirichlet-Neumann and the ... Voir le document complet

25

Efficient local search for several combinatorial optimization problems

Efficient local search for several combinatorial optimization problems

... In this chapter we highlight the main contributions of our research and summarize the main ...scope and the aims of this thesis are to investigate how to efficiently solve several difficult ... Voir le document complet

199

Controlling iterated jumps of solutions to combinatorial problems

Controlling iterated jumps of solutions to combinatorial problems

... -acceptation and R α ..., and therefore Π 0 2 if X is ∆ 0 2 , which raises new problems for obtaining a forcing relation of weak definitional ...parts” and prove that for every infinite ...α ... Voir le document complet

32

A spatial Markov Queueing Process and its Applications to Wireless Loss Systems

A spatial Markov Queueing Process and its Applications to Wireless Loss Systems

... links, and where the coexistence of calls on a common link is only possible if sufficiently many free resources are available on this ...link. In wireless communications, one needs to take into account the ... Voir le document complet

30

The achievable region method in the optimal control of queueing systems : formulations, bounds and policies

The achievable region method in the optimal control of queueing systems : formulations, bounds and policies

... Overall the proposed approach for stochastic control problems parallels efforts of the mathematical programming community in the last twenty years to develop sharper [r] ... Voir le document complet

49

The achievable region method in the optimal control of queueing systems : formulations, bounds and policies

The achievable region method in the optimal control of queueing systems : formulations, bounds and policies

... Overall the proposed approach for stochastic control problems parallels efforts of the mathematical programming community in the last twenty years to develop sharper for[r] ... Voir le document complet

51

Counting walks in a quadrant: a unified approach via boundary value problems

Counting walks in a quadrant: a unified approach via boundary value problems

... w and e w have been found in [ 17 ], Theorem 3 gives the simplified expression of these functions in all finite group cases, indeed see the tables in [ 6 ] or Figure 6 in this ...3 ... Voir le document complet

29

Combinatorial Preconditioners for Scalar Elliptic Finite-Element Problems

Combinatorial Preconditioners for Scalar Elliptic Finite-Element Problems

... In one technique, the approximation problem is formulated as an optimization problem, in which one tries to minimize the generalized condition number of a given element matrix Ke and an [r] ... Voir le document complet

28

Enriching Solutions to Combinatorial Problems via Solution Engineering

Enriching Solutions to Combinatorial Problems via Solution Engineering

... union, and a set of constraints ...X, and rel(c) is a relation that restricts the allowed combinations of simultaneous value assignments for the variables in ...if and only if x takes its ... Voir le document complet

32

Weight-based heuristics for constraint satisfaction and combinatorial optimization problems

Weight-based heuristics for constraint satisfaction and combinatorial optimization problems

... principles and references are given in the next section on the scientific ...failures in the search tree and derive variables weighting for ordering ...heuristics. In the first part of ... Voir le document complet

30

Show all 10000 documents...