Sciweavers

2137 search results - page 388 / 428
» Approximation Algorithms for Some Graph Partitioning Problem...
Sort
View
GECCO
2006
Springer
133views Optimization» more  GECCO 2006»
15 years 5 months ago
A general coarse-graining framework for studying simultaneous inter-population constraints induced by evolutionary operations
The use of genotypic populations is necessary for adaptation in Evolutionary Algorithms. We use a technique called form-invariant commutation to study the immediate effect of evol...
Keki M. Burjorjee, Jordan B. Pollack
SODA
2010
ACM
179views Algorithms» more  SODA 2010»
15 years 11 months ago
Property Testing and Parameter Testing for Permutations
There has been great interest in deciding whether a combinatorial structure satisfies some property, or in estimating the value of some numerical function associated with this com...
Carlos Hoppen, Yoshiharu Kohayakawa, Carlos G. T. ...
IJRR
2008
92views more  IJRR 2008»
15 years 1 months ago
Robust and Efficient Covering of Unknown Continuous Domains with Simple, Ant-Like A(ge)nts
We propose a new `Mark-Ant-Walk' algorithm for robust and efficient covering of continuous domains by ant-like robots with very limited capabilities. The robots can mark plac...
Eliyahu Osherovich, Vladimir Yanovski, Israel A. W...
ICIP
1998
IEEE
15 years 6 months ago
Multiple-Description Wavelet based Image Coding
Abstract--We consider the problem of coding images for transmission over error-prone channels. The impairments we target are transient channel shutdowns, as would occur in a packet...
Sergio D. Servetto, Kannan Ramchandran, Vinay A. V...
CORR
2010
Springer
159views Education» more  CORR 2010»
14 years 11 months ago
On optimizing over lift-and-project closures
The lift-and-project closure is the relaxation obtained by computing all lift-and-project cuts from the initial formulation of a mixed integer linear program or equivalently by co...
Pierre Bonami