630 search results - page 66 / 126 » Hardness results for approximating the bandwidth |
108
click to vote
LION
2010
Springer
15 years 4 months ago
2010
Springer
MOEA/D is a multi-objective metaheuristic which has shown a remarkable performance when solving hard optimization problems. In this paper, we propose a thread-based parallel versio...
94
Voted
AAAI
2007
15 years 2 months ago
2007
Developing scalable coordination algorithms for multi-agent systems is a hard computational challenge. One useful approach, demonstrated by the Coverage Set Algorithm (CSA), explo...
132
click to vote
UAI
1998
15 years 1 months ago
1998
In recent years there has been a flurry of works on learning Bayesian networks from data. One of the hard problems in this area is how to effectively learn the structure of a beli...
94
Voted
TRANSCI
2002
15 years 7 days ago
2002
Vendor managed inventory replenishment is a business practice in which vendors monitor their customers' inventories, and decide when and how much inventory should be replenis...
102
Voted
CORR
2011
Springer
14 years 7 months ago
2011
Springer
We describe a new variational lower-bound on the minimum energy configuration of a planar binary Markov Random Field (MRF). Our method is based on adding auxiliary nodes to every...