Sciweavers

1182 search results - page 148 / 237
» Iterative Methods in Combinatorial Optimization
Sort
View
132
Voted
STACS
2007
Springer
15 years 8 months ago
Broadcasting vs. Mixing and Information Dissemination on Cayley Graphs
One frequently studied problem in the context of information dissemination in communication networks is the broadcasting problem. In this paper, we study the following randomized b...
Robert Elsässer, Thomas Sauerwald
117
Voted
ICCV
2005
IEEE
15 years 8 months ago
KALMANSAC: Robust Filtering by Consensus
We propose an algorithm to perform causal inference of the state of a dynamical model when the measurements are corrupted by outliers. While the optimal (maximumlikelihood) soluti...
Andrea Vedaldi, Hailin Jin, Paolo Favaro, Stefano ...
129
Voted
CEC
2010
IEEE
15 years 3 months ago
Geometric Nelder-Mead Algorithm for the permutation representation
The Nelder-Mead Algorithm (NMA) is an almost half-century old method for numerical optimization, and it is a close relative of Particle Swarm Optimization (PSO) and Differential Ev...
Alberto Moraglio, Julian Togelius
116
Voted
GLOBECOM
2008
IEEE
15 years 2 months ago
Network Planning for Next-Generation Metropolitan-Area Broadband Access under EPON-WiMAX Integration
Abstract--This paper tackles a fundamental problem of network planning and dimensioning under EPON-WiMAX integration for next-generation wireless metropolitan-area broadband access...
Bin Lin, Pin-Han Ho, Xuemin Shen, Frank Chih-Wei S...
ALGORITHMICA
2006
77views more  ALGORITHMICA 2006»
15 years 2 months ago
Scalable Parallel Algorithms for FPT Problems
Algorithmic methods based on the theory of fixed-parameter tractability are combined with powerful computational platforms to launch systematic attacks on combinatorial problems o...
Faisal N. Abu-Khzam, Michael A. Langston, Pushkar ...