Sciweavers

2694 search results - page 106 / 539
» Fully Distributed Algorithms for Convex Optimization Problem...
Sort
View
156
Voted
ICASSP
2011
IEEE
14 years 6 months ago
Efficient distributed resampling for particle filters
In particle filtering, resampling is the only step that cannot be fully parallelized. Recently, we have proposed algorithms for distributed resampling implemented on architecture...
Balakumar Balasingam, Miodrag Bolic, Petar M. Djur...
123
Voted
PPSN
1998
Springer
15 years 6 months ago
Genetic Algorithms for the Multiple Container Packing Problem
This paper presents two variants of Genetic Algorithms (GAs) for solving the Multiple Container Packing Problem (MCPP), which is a combinatorial optimization problem comprising sim...
Günther R. Raidl, Gabriele Kodydek
IPPS
2006
IEEE
15 years 8 months ago
Ant stigmergy on the grid: optimizing the cooling process in continuous steel casting
The paper presents a new distributed metaheuristic algorithm in an optimal control problem related to the cooling process in the continuous casting of steel. The optimization task...
Peter Korosec, Jurij Silc, Bogdan Filipic, Erkki L...
ISAAC
2007
Springer
93views Algorithms» more  ISAAC 2007»
15 years 8 months ago
Dilation-Optimal Edge Deletion in Polygonal Cycles
Abstract. Let C be a polygonal cycle on n vertices in the plane. A randomized algorithm is presented which computes in O(n log3 n) expected time, the edge of C whose removal result...
Hee-Kap Ahn, Mohammad Farshi, Christian Knauer, Mi...
STOC
1995
ACM
115views Algorithms» more  STOC 1995»
15 years 6 months ago
Geometric lower bounds for parametric matroid optimization
We relate the sequence of minimum bases of a matroid with linearly varying weights to three problems from combinatorial geometry: k-sets, lower envelopes of line segments, and con...
David Eppstein