4110 search results - page 57 / 822 » Efficient algorithms for the 2-gathering problem |
152
Voted
EVOW
2006
Springer
15 years 7 months ago
2006
Springer
Many applications involve matching two graphs in order to identify their common features and compute their similarity. In this paper, we address the problem of computing a graph si...
151
Voted
ACL
2010
15 years 1 months ago
2010
The Viterbi algorithm is the conventional decoding algorithm most widely adopted for sequence labeling. Viterbi decoding is, however, prohibitively slow when the label set is larg...
127
click to vote
SIAMSC
2010
14 years 10 months ago
2010
Abstract. We develop in this paper some efficient algorithms which are essential to implementations of spectral methods on the sparse grid by Smolyak's construction based on a...
133
Voted
AAAI
2008
2008
Abduction with Bounded Treewidth: From Theoretical Tractability to Practically Efficient Computation
15 years 6 months ago
Abductive diagnosis is an important method to identify explanations for a given set of observations. Unfortunately, most of the algorithmic problems in this area are intractable. ...
111
click to vote
GECCO
2004
Springer
15 years 9 months ago
2004
Springer
In this paper, a novel multi-objective orthogonal simulated annealing algorithm MOOSA using a generalized Pareto-based scale-independent fitness function and multi-objective intell...