Sciweavers

393 search results - page 23 / 79
» The LCA Problem Revisited
Sort
View
CP
2008
Springer
15 years 3 months ago
Revisiting the Upper Bounding Process in a Safe Branch and Bound Algorithm
Abstract. Finding feasible points for which the proof succeeds is a critical issue in safe Branch and Bound algorithms which handle continuous problems. In this paper, we introduce...
Alexandre Goldsztejn, Yahia Lebbah, Claude Michel,...
61
Voted
CORR
2006
Springer
66views Education» more  CORR 2006»
15 years 1 months ago
MDL Denoising Revisited
We refine and extend an earlier MDL denoising criterion for wavelet-based denoising. We start by showing that the denoising problem can be reformulated as a clustering problem, whe...
Teemu Roos, Petri Myllymäki, Jorma Rissanen
TEC
1998
99views more  TEC 1998»
15 years 1 months ago
Fitness sharing and niching methods revisited
Abstract—Interest in multimodal optimization function is expanding rapidly since real-world optimization problems often require the location of multiple optima in the search spac...
Bruno Sareni, Laurent Krähenbühl
129
Voted
PIMRC
2010
IEEE
14 years 11 months ago
Joint channel assignment and link scheduling for wireless mesh networks: Revisiting the Partially Overlapped Channels
Despite all the encouraging reports on the benefit of Partially Overlapped Channels (POCs), the relative simple interference models and rather arbitrary network settings considered...
Xiang Liu, Jun Luo
COMPUTING
2010
14 years 11 months ago
Minimization of SONET ADMs in ring networks revisited
We design improved approximation algorithms for two variants of the ADM minimization problem. SONET add-drop multiplexers (ADMs) are the dominant cost factor in SONET/WDM rings. T...
Leah Epstein, Asaf Levin, Betzalel Menahem