Sciweavers

9176 search results - page 319 / 1836
» algorithms 2010
Sort
View
ICDT
2010
ACM
137views Database» more  ICDT 2010»
15 years 5 months ago
A Greedy Algorithm for Constructing a Low-Width Generalized Hypertree Decomposition
We propose a greedy algorithm which, given a hypergraph H and a positive integer k, produces a hypertree decomposition of width less than or equal to 3k −1, or determines that H...
Kaoru Katayama, Tatsuro Okawara, Yuka Itou
APPROX
2010
Springer
188views Algorithms» more  APPROX 2010»
15 years 8 months ago
Approximation Algorithms for Reliable Stochastic Combinatorial Optimization
We consider optimization problems that can be formulated as minimizing the cost of a feasible solution wT x over an arbitrary combinatorial feasible set F {0, 1}n . For these pro...
Evdokia Nikolova
DSS
2007
127views more  DSS 2007»
15 years 6 months ago
Large-scale regulatory network analysis from microarray data: modified Bayesian network learning and association rule mining
We present two algorithms for learning large-scale gene regulatory networks from microarray data: a modified informationtheory-based Bayesian network algorithm and a modified asso...
Zan Huang, Jiexun Li, Hua Su, George S. Watts, Hsi...
4OR
2010
82views more  4OR 2010»
15 years 6 months ago
Diversification-driven tabu search for unconstrained binary quadratic problems
This paper describes a Diversification-Driven Tabu Search (D2 TS) algorithm for solving unconstrained binary quadratic problems. D2 TS is dis
Fred Glover, Zhipeng Lü, Jin-Kao Hao
DM
2010
108views more  DM 2010»
15 years 6 months ago
Grundy number and products of graphs
The Grundy number of a graph G, denoted by (G), is the largest k such that G has a greedy k-colouring, that is a colouring with k colours obtained by applying the greedy algorithm...
Marie Asté, Frédéric Havet, C...