Sciweavers

2340 search results - page 425 / 468
» Copying and Comparing: Problems and Solutions
Sort
View
FOCS
2008
IEEE
15 years 7 months ago
Set Covering with our Eyes Closed
Given a universe U of n elements and a weighted collection S of m subsets of U, the universal set cover problem is to a-priori map each element u ∈ U to a set S(u) ∈ S contain...
Fabrizio Grandoni, Anupam Gupta, Stefano Leonardi,...
CGF
2008
80views more  CGF 2008»
15 years 6 months ago
A Semi-Lagrangian CIP Fluid Solver without Dimensional Splitting
In this paper, we propose a new constrained interpolation profile (CIP) method that is stable and accurate but requires less amount of computation compared to existing CIP-based s...
Doyub Kim, Oh-Young Song, Hyeong-Seok Ko
AAI
2006
106views more  AAI 2006»
15 years 6 months ago
Metaheuristics for Handling Time Interval Coverage Constraints in Nurse Scheduling
The problem of finding a high quality timetable for personnel in a hospital ward has been addressed by many researchers, personnel managers and schedulers over a number of years. ...
Edmund K. Burke, Patrick De Causmaecker, Sanja Pet...
BMCBI
2006
138views more  BMCBI 2006»
15 years 6 months ago
Approximation properties of haplotype tagging
Background: Single nucleotide polymorphisms (SNPs) are locations at which the genomic sequences of population members differ. Since these differences are known to follow patterns,...
Staal A. Vinterbo, Stephan Dreiseitl, Lucila Ohno-...
AI
2005
Springer
15 years 6 months ago
The distributed breakout algorithms
We present a new series of distributed constraint satisfaction algorithms, the distributed breakout algorithms, which is inspired by local search algorithms for solving the constr...
Katsutoshi Hirayama, Makoto Yokoo