intTypePromotion=1
ADSENSE

Probabilistic minimum coloring

Xem 1-1 trên 1 kết quả Probabilistic minimum coloring
  • The most common way in which probabilities are associated with combinatorial optimization problems is to consider that the data of the problem are deterministic (always present) and randomness carries over the relation between these data (for example, randomness on the existence of an edge linking two vertices in the framework of a random graph theory problem ([BOL 85]) or randomness on the fact that an element is included to a set or not, when dealing with optimization problems on set-systems or, even, randomness on the execution time of a task in scheduling problems).

    pdf268p thienbinh1311 13-12-2012 24 1   Download

CHỦ ĐỀ BẠN MUỐN TÌM

ADSENSE

p_strKeyword=Probabilistic minimum coloring
p_strCode=probabilisticminimumcoloring

nocache searchPhinxDoc

 

Đồng bộ tài khoản
2=>2