Sciweavers

62 search results - page 9 / 13
» A genetic algorithm encoding for a class of cardinality cons...
Sort
View
EC
2008
146views ECommerce» more  EC 2008»
13 years 6 months ago
Automated Discovery of Local Search Heuristics for Satisfiability Testing
The development of successful metaheuristic algorithms such as local search for a difficult problems such as satisfiability testing (SAT) is a challenging task. We investigate an ...
Alex S. Fukunaga
FOCS
2009
IEEE
14 years 1 months ago
Symmetry and Approximability of Submodular Maximization Problems
Abstract— A number of recent results on optimization problems involving submodular functions have made use of the ”multilinear relaxation” of the problem [3], [8], [24], [14]...
Jan Vondrák
SAT
2009
Springer
95views Hardware» more  SAT 2009»
14 years 1 months ago
Finding Lean Induced Cycles in Binary Hypercubes
Induced (chord-free) cycles in binary hypercubes have many applications in computer science. The state of the art for computing such cycles relies on genetic algorithms, which are,...
Yury Chebiryak, Thomas Wahl, Daniel Kroening, Leop...
GLOBECOM
2006
IEEE
14 years 23 days ago
Algorithms for Server Placement in Multiple-Description-Based Media Streaming
— Multiple description coding (MDC) has emerged as a powerful technique for reliable real-time communications over lossy packet networks. In its basic form, it involves encoding ...
Satyajeet Ahuja, Marwan Krunz
TIT
2008
74views more  TIT 2008»
13 years 6 months ago
Optimal Parsing Trees for Run-Length Coding of Biased Data
Abstract-- We study coding schemes which encode unconstrained sequences into run-length-limited (d, k)-constrained sequences. We present a general framework for the construction of...
Sharon Aviran, Paul H. Siegel, Jack K. Wolf