Sciweavers

840 search results - page 42 / 168
» Inapproximability of Combinatorial Optimization Problems
Sort
View
COCOA
2009
Springer
14 years 5 months ago
Matching Techniques Ride to Rescue OLED Displays
Combinatorial optimization problems have recently emerged in the design of controllers for OLED displays. The objective is to decompose an image into subframes minimizing the addre...
Andreas Karrenbauer
GECCO
2004
Springer
119views Optimization» more  GECCO 2004»
14 years 4 months ago
Randomized Local Search, Evolutionary Algorithms, and the Minimum Spanning Tree Problem
Randomized search heuristics, among them randomized local search and evolutionary algorithms, are applied to problems whose structure is not well understood, as well as to problems...
Frank Neumann, Ingo Wegener
QSIC
2003
IEEE
14 years 4 months ago
Generating Small Combinatorial Test Suites to Cover Input-Output Relationships
In this paper, we consider a problem that arises in black box testing: generating small test suites (i.e., sets of test cases) where the combinations that have to be covered are s...
Christine Cheng, Adrian Dumitrescu, Patrick J. Sch...
TCBB
2008
126views more  TCBB 2008»
13 years 11 months ago
Combinatorial Approaches for Mass Spectra Recalibration
Mass spectrometry has become one of the most popular analysis techniques in Proteomics and Systems Biology. With the creation of larger data sets, the automated recalibration of ma...
Sebastian Böcker, Veli Mäkinen
GECCO
2006
Springer
152views Optimization» more  GECCO 2006»
14 years 2 months ago
A combinatorial genetic algorithm for the configuration of the 2dF/AAOmega spectrograph at the anglo-Australian observatory
To help unravel the structure of the universe, astronomers have developed systems which observe large clusters of objects at the same time. One such system is the 2-degree field s...
Steven Manos, Geraint Lewis