• Aucun résultat trouvé

Haut PDF A priori optimization for the probabilistic maximum independent set problem

A priori optimization for the probabilistic maximum independent set problem

A priori optimization for the probabilistic maximum independent set problem

... of the instan e and this seems somewhat unusual with respe t to standard omplexity theory where no algorithm intervenes in the denition of a prob- ...algorithm for P, in the sense ...

26

Average-case complexity of a branch-and-bound algorithm for maximum independent set, under the $\mathcal{G}(n,p)$ random model

Average-case complexity of a branch-and-bound algorithm for maximum independent set, under the $\mathcal{G}(n,p)$ random model

... configuration for the vertices v 1 to v i−1 ...either the partial solution represented by t is infeasible, or no hope exists that expansion of this solution will lead to an optimal solution ...

15

The probabilistic minimum vertex covering problem

The probabilistic minimum vertex covering problem

... study the realisti per- forman es of the three strategies ...in the following way: for ea h graph, a number p E ∈ [0, 1] is randomly drawn; next, for ea h edge e , a ...

16

Robust maximum weighted independent-set problems on interval graphs

Robust maximum weighted independent-set problems on interval graphs

... graphs; independent set; dynamic ...14]. The solution procedure of some of these problems involves solving a maximum weighted independent-set problem (MWIS) where ...

7

On the probabilistic min spanning tree problem

On the probabilistic min spanning tree problem

... of the computation of the functional is, in general, not ...Several optimization frameworks have been introduced by the operations research community for handling data uncertainty, ...

28

A relation between the approximated versions of minimum set covering, minimum vertex covering and maximum independent set

A relation between the approximated versions of minimum set covering, minimum vertex covering and maximum independent set

... SC the degrees of the C-vertices are equal to ...as the characteristic graph of this instance. Consequently, the result of [1] is valid for SC ...that a PTAA for SC ...

12

On the Termination Problem for Probabilistic Higher-Order Recursive Programs

On the Termination Problem for Probabilistic Higher-Order Recursive Programs

... fact, the value of f (1) for Incomp is ...as a probability. We have included them since they show a source of the possible incompleteness of our ...Indeed, the tool fails to find ...

62

Advanced metaheuristics for the probabilistic orienteering problem

Advanced metaheuristics for the probabilistic orienteering problem

... with a cluster of customers and is gained only when all customers in the cluster are ...served. The probabilistic variations of the OP are mainly considering uncertainty on time and /or ...

120

Exact and Heuristic Algorithms for the Indel Maximum Likelihood Problem

Exact and Heuristic Algorithms for the Indel Maximum Likelihood Problem

... 2004). A maximum likelihood reconstruction would be preferable to a most parsimo- nious reconstruction because it would provide a way of weighing insertions and deletions of various lengths ...

36

Fast Algorithms for max independent set

Fast Algorithms for max independent set

... As a first result, we improve in this paper the bound of [8] down to O ∗ ...proposing a finer and more detailed case analysis based upon powerful reduction rules (Section ...also for connected ...

29

A Comparison of Decomposition Methods for the Maximum Common Subgraph Problem

A Comparison of Decomposition Methods for the Maximum Common Subgraph Problem

... speedup the solution process of CP, we may parallelize it as proposed in [4], ...[5]. The idea is to split the initial CSP into a large number of independent subproblems which are ...

9

The maximum saving partition problem

The maximum saving partition problem

... is, for any two disjoint subsets S and T , f (S ∪ T ) ≤ f (S) + f (T ...thus, the worst possible solution, that assigns each job to a distinct machine, costs wor = P i∈V w i ...in a ...

10

Probabilistic data association: the orbit set

Probabilistic data association: the orbit set

... in the past, thus delivering many more observations than ...with the ever-growing number of RSOs, calls for more efficient methods able to deal with the amount of data produced (Hussein et ...

28

The probabilistic k-center problem

The probabilistic k-center problem

... of Probabilistic combinatorial optimization [3–5], also known as a priori optimization, is par- ticularly suitable to model such situations, where one has to deal with destructions or ...

13

The complexity of the exact weighted independent set problem

The complexity of the exact weighted independent set problem

... open problem motivates us to introduce and study the exact weighted inde- pendent set problem and a restricted version of it, both closely related to the exact perfect matching ...

41

On the Maximum Independent Set Problem in Subclasses of Subcubic Graphs

On the Maximum Independent Set Problem in Subclasses of Subcubic Graphs

... respectively. For a vertex v ∈ V (G), we denote by N(v) the neighborhood of v, ...i.e., the set of vertices adjacent to v, and by N[v] the closed neighbourhood of v, ...{v}. ...

13

Constructive-non-constructive approximation and maximum independent set problem

Constructive-non-constructive approximation and maximum independent set problem

... least a maximum-weight independent set of G (k) not containing v x ...On the other hand, for every edge v i v j of G (k) , both of its endpoints cannot simultaneously belong to ...

20

The max quasi-independent set problem

The max quasi-independent set problem

... preliminaries The problem of finding in a graph a maximum-size subgraph whose density differs (being smaller or larger) from that of the whole graph, arises often in various ...

16

The Max Quasi-Independent Set Problem

The Max Quasi-Independent Set Problem

... essentially the same problem as γ-QIS is addressed, formulated as the research, given a graph and 0 ≤ γ ≤ 1, of a maximum subgraph of sparsity (defined as the ratio of ...

21

A Priori Knowledge Integration in Evolutionary Optimization

A Priori Knowledge Integration in Evolutionary Optimization

... evaluated. The exploratory strategy dur- ing the whole optimization process gives the better results, so it have been selected form the following ...evaluated. The results are ...

13

Show all 10000 documents...