14158 search results - page 212 / 2832 » Generalized switch-setting problems |
121
Voted
CISSE
2009
Springer
15 years 7 months ago
2009
Springer
: We show that estimating the complexity (mean and distribution) of the instances of a fixed size Constraint Satisfaction Problem (CSP) can be very hard. We deal with the main two ...
136
Voted
LATIN
2000
Springer
15 years 7 months ago
2000
Springer
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...
128
Voted
VLDB
1991
ACM
15 years 7 months ago
1991
ACM
Domain mismatch and schema mismatch are two of the important semantic integration problems for interoperating heterogeneous databases. This paper structures the domain mismatch pr...
129
Voted
FFA
2008
15 years 3 months ago
2008
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...
160
Voted
COMBINATORICA
2010
14 years 10 months ago
2010
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...