14386 search results - page 197 / 2878 » The Chinese Generals Problem |
143
click to vote
IFIP
2004
Springer
15 years 9 months ago
2004
Springer
We study the general packing problem with M constraints. In [Jansen and Zhang, TCS 2002] a c(1 + ε)-approximation algorithm for the general packing problem was proposed. A block s...
122
Voted
DAC
1998
ACM
16 years 4 months ago
1998
ACM
In this paper we present a new global router appropriate for Multichip Module MCM and dense Printed Circuit Board PCB design, which utilizes a hybrid of the classical rip-up and r...
155
Voted
WILF
2007
Springer
15 years 10 months ago
2007
Springer
Background: Quantitative analysis of differential protein expressions requires to align temporal elution measurements from liquid chromatography coupled to mass spectrometry (LC/M...
135
click to vote
ATAL
2003
Springer
15 years 9 months ago
2003
Springer
Combinatorial auctions where agents can bid on bundles of items are desirable because they allow the agents to express complementarity and substitutability between the items. Howe...
152
click to vote
FCT
2003
Springer
15 years 9 months ago
2003
Springer
The bandwidth minimization problem has a long history and a number of practical applications. In this paper we introduce a natural extension of bandwidth to partially ordered layo...