Sciweavers

2354 search results - page 177 / 471
» Assignment Problems
Sort
View
APPROX
2000
Springer
153views Algorithms» more  APPROX 2000»
15 years 10 months ago
Randomized path coloring on binary trees
Motivated by the problem of WDM routing in all–optical networks, we study the following NP–hard problem. We are given a directed binary tree T and a set R of directed paths on ...
Vincenzo Auletta, Ioannis Caragiannis, Christos Ka...
FMCAD
2006
Springer
15 years 10 months ago
Finite Instantiations for Integer Difference Logic
The last few years have seen the advent of a new breed of decision procedures for various fragments of first-order logic based on ional abstraction. A lazy satisfiability checker ...
Hyondeuk Kim, Fabio Somenzi
HM
2010
Springer
146views Optimization» more  HM 2010»
15 years 6 months ago
An Improved Memetic Algorithm for Break Scheduling
In this paper we consider solving a complex real life break scheduling problem. This problem of high practical relevance arises in many working areas, e.g. in air traffic control a...
Magdalena Widl, Nysret Musliu
TCBB
2008
126views more  TCBB 2008»
15 years 6 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
JCM
2007
105views more  JCM 2007»
15 years 6 months ago
A Flexible Wavelength Converter Placement Scheme for Guaranteed Wavelength Usage
Abstract— Wavelength is one of the most important resources in Wavelength Division Multiplexing(WDM) networks. In optical routing, we are given a set of communication paths (or l...
Can Fang, Chor Ping Low