Sciweavers

1258 search results - page 159 / 252
» Architecture-driven Problem Decomposition
Sort
View
FOCS
2006
IEEE
15 years 7 months ago
Approximate Min-Max Theorems of Steiner Rooted-Orientations of Hypergraphs
Given an undirected hypergraph and a subset of vertices S ⊆ V with a specified root vertex r ∈ S, the STEINER ROOTED-ORIENTATION problem is to find an orientation of all the...
Tamás Király, Lap Chi Lau
103
Voted
ICIP
2003
IEEE
15 years 7 months ago
Effective detection and elimination of impulsive noise with a minimal image smoothing
Impulsive noise filtering is an important problem of image processing. The problem of noise elimination in an image has a companion problem, the problem of maximal preservation of...
Igor N. Aizenberg, Jaakko Astola, Constantine Buta...
PPSN
1998
Springer
15 years 6 months ago
Modeling Building-Block Interdependency
The Building-Block Hypothesis appeals to the notion of problem decomposition and the assembly of solutions from sub-solutions. Accordingly, there have been many varieties of GA tes...
Richard A. Watson, Gregory Hornby, Jordan B. Polla...
SODA
2008
ACM
101views Algorithms» more  SODA 2008»
15 years 3 months ago
Adaptive local ratio
Local ratio is a well-known paradigm for designing approximation algorithms for combinatorial optimization problems. At a very high level, a local-ratio algorithm first decomposes ...
Julián Mestre
CEC
2010
IEEE
15 years 1 months ago
Cooperative Co-evolution with delta grouping for large scale non-separable function optimization
— Many evolutionary algorithms have been proposed for large scale optimization. Parameter interaction in nonseparable problems is a major source of performance loss specially on ...
Mohammad Nabi Omidvar, Xiaodong Li, Xin Yao