392 search results - page 37 / 79 » Maximal Completion |
RTDB
1996
13 years 10 months ago
1996
We propose and evaluate an admission control paradigm for RTDBS, in which a transaction is submitted to the system as a pair of processes: a primary task, and a recovery block. Th...
DISOPT
2010
13 years 9 months ago
2010
We consider labeled Traveling Salesman Problems, defined upon a complete graph of n vertices with colored edges. The objective is to find a tour of maximum or minimum number of co...
TIT
2008
13 years 9 months ago
2008
This paper considers the maximization of information rates for the Gaussian frequency-selective interference channel, subject to power and spectral mask constraints on each link. T...
JGAA
2000
13 years 8 months ago
2000
This paper considers problems of the following type: given an edgeweighted k-colored input graph with maximum color class size c, find a minimum or maximum c-way cut such that eac...
TIT
2002
13 years 8 months ago
2002
We develop methods for analyzing and constructing combined modulation/error-correctiong codes (ECC codes), in particular codes that employ some form of reversed concatenation and w...