1688 search results - page 30 / 338 » The Complexity of Rationalizing Matchings |
COCO
1998
Springer
13 years 12 months ago
1998
Springer
We show that the perfect matching problem is in the complexity class SPL in the nonuniform setting. This provides a better upper bound on the complexity of the matching problem, a...
APSEC
2007
IEEE
14 years 1 months ago
2007
IEEE
A customer reported problem (or Trouble Ticket) in software maintenance is typically solved by one or more maintenance engineers. The decision of allocating the ticket to one or m...
DISOPT
2007
13 years 7 months ago
2007
We investigate the computational complexity of a combinatorial problem that arises in DNA sequencing by hybridization: The input consists of an integer together with a set S of wo...
ATAL
2010
Springer
13 years 8 months ago
2010
Springer
We resolve an open problem regarding the complexity of unweighted coalitional manipulation, namely, the complexity of Copeland -manipulation for {0, 1}. Copeland , 0 1, is an...
ICDE
2011
IEEE
12 years 11 months ago
2011
IEEE
— We demonstrate a hardware implementation of a complex event processor, built on top of field-programmable gate arrays (FPGAs). Compared to CPU-based commodity systems, our sol...