1046 search results - page 39 / 210 » Approximation Algorithms for Domination Search |
AUSAI
2004
Springer
14 years 1 months ago
2004
Springer
We describe an Ant Colony Optimization (ACO) algorithm, ANT-MPE, for the most probable explanation problem in Bayesian network inference. After tuning its parameters settings, we c...
IPPS
2006
IEEE
14 years 2 months ago
2006
IEEE
Approximate string matching problem is a common and often repeated task in information retrieval and bioinformatics. This paper proposes a generic design of a programmable array p...
CEC
2005
IEEE
14 years 2 months ago
2005
IEEE
Abstract- This paper presents a new operator for genetic algorithms that enhances their convergence in the case of nonlinear problems with nonlinear equality constraints. The propo...
ICRA
2008
IEEE
14 years 2 months ago
2008
IEEE
Abstract— We report our algorithmic development of the pframe problem that addresses the need of coordinating a set of p networked robotic pan-tilt-zoom cameras for n, (n > p)...
ANOR
2011
13 years 3 months ago
2011
Abstract The multiple knapsack problem (MKP) is a classical combinatorial optimization problem. A recent algorithm for some classes of the MKP is bin-completion, a bin-oriented, br...