14158 search results - page 439 / 2832 » Generalized switch-setting problems |
140
click to vote
WADS
1995
Springer
15 years 9 months ago
1995
Springer
We examine the problem of transmitting in minimum time a given amount of data between a source and a destination in a network with finite channel capacities and non–zero propaga...
163
click to vote
OPODIS
2008
15 years 7 months ago
2008
We study the group renaming problem, which is a natural generalization of the renaming problem. An instance of this problem consists of n processors, partitioned into m groups, ea...
168
click to vote
DAM
2008
15 years 6 months ago
2008
: We consider a problem of searching an element in a partially ordered set (poset). The goal is to find a search strategy which minimizes the number of comparisons. Ben-Asher, Farc...
154
click to vote
RECOMB
2003
Springer
16 years 6 months ago
2003
Springer
Many genomic sequences and, more generally, (multivariate) time series display tremendous variability. However, often it is reasonable to assume that the sequence is actually gene...
147
click to vote
STOC
2002
ACM
16 years 6 months ago
2002
ACM
We consider the problem of estimating the tour length and finding approximation algorithms for the asymmetric traveling salesman problem arising from the disk scheduling problem. ...