Sciweavers

260 search results - page 14 / 52
» Quality guarantees for region optimal DCOP algorithms
Sort
View
CSC
2006
13 years 8 months ago
An Algorithm to Solve a Linear Program
: This work is about an algorithm for solving a linear program which is simple to apply. There are three algorithms in this work. The first algorithm solves a two-variable linear p...
Rajan Alex
EPS
1998
Springer
13 years 11 months ago
Evolutionary Algorithms for Vertex Cover
This paper reports work investigating various evolutionary approaches to vertex cover (VC), a well-known NP-Hard optimization problem. Central to each of the algorithms is a novel ...
Isaac K. Evans
COR
2006
122views more  COR 2006»
13 years 7 months ago
Experimental Analysis of Approximation Algorithms for the Vertex Cover and Set Covering Problems
Several approximation algorithms with proven performance guarantees have been proposed to find approximate solutions to classical combinatorial optimization problems. However, the...
Fernando C. Gomes, Cláudio Nogueira de Mene...
CORR
2010
Springer
134views Education» more  CORR 2010»
13 years 7 months ago
Incremental Sampling-based Algorithms for Optimal Motion Planning
During the last decade, incremental sampling-based motion planning algorithms, such as the Rapidly-exploring Random Trees (RRTs), have been shown to work well in practice and to po...
Sertac Karaman, Emilio Frazzoli
CEC
2010
IEEE
13 years 8 months ago
A novel memetic algorithm for constrained optimization
In this paper, we present a memetic algorithm with novel local optimizer hybridization strategy for constrained optimization. The developed MA consists of multiple cycles. In each ...
Jianyong Sun, Jonathan M. Garibaldi