Sciweavers

14165 search results - page 197 / 2833
» The generalized two-server problem
Sort
View
LATIN
2000
Springer
15 years 8 months ago
Approximation Algorithms for Flexible Job Shop Problems
The Flexible Job Shop problem is a generalization of the classical job shop scheduling problem in which for every operation there is a group of machines that can process it. The p...
Klaus Jansen, Monaldo Mastrolilli, Roberto Solis-O...
VLDB
1991
ACM
101views Database» more  VLDB 1991»
15 years 8 months ago
Solving Domain Mismatch and Schema Mismatch Problems with an Object-Oriented Database Programming Language
Domain mismatch and schema mismatch are two of the important semantic integration problems for interoperating heterogeneous databases. This paper structures the domain mismatch pr...
William Kent
FFA
2008
76views more  FFA 2008»
15 years 4 months ago
On the subset sum problem over finite fields
Abstract. The subset sum problem over finite fields is a well known NPcomplete problem. It arises naturally from decoding generalized Reed-Solomon codes. In this paper, we study th...
Jiyou Li, Daqing Wan
NA
2010
62views more  NA 2010»
15 years 2 months ago
Noise-reducing cascadic multilevel methods for linear discrete ill-posed problems
Cascadic multilevel methods for the solution of linear discrete ill-posed problems with noise-reducing restriction and prolongation operators recently have been developed for the r...
Serena Morigi, Lothar Reichel, Fiorella Sgallari
COMBINATORICA
2010
14 years 11 months ago
Approximation algorithms via contraction decomposition
We prove that the edges of every graph of bounded (Euler) genus can be partitioned into any prescribed number k of pieces such that contracting any piece results in a graph of bou...
Erik D. Demaine, MohammadTaghi Hajiaghayi, Bojan M...