14165 search results - page 514 / 2833 » The generalized two-server problem |
176
click to vote
SIAMCOMP
2008
15 years 6 months ago
2008
We consider a game-theoretical variant of the Steiner forest problem in which each player j, out of a set of k players, strives to connect his terminal pair (sj, tj) of vertices in...
153
click to vote
IPL
2007
15 years 6 months ago
2007
We study the approximability and inapproximability of finding identifying codes and locating-dominating codes of the minimum size. In general graphs, we show that it is possible ...
194
click to vote
CANDC
2005
ACM
15 years 6 months ago
2005
ACM
Given an assembled genome of a diploid organism the haplotype assembly problem can be formulated as retrieval of a pair of haplotypes from a set of aligned weighted SNP fragments....
145
click to vote
AMAI
2002
Springer
15 years 6 months ago
2002
Springer
: Mereotopology faces problems when its methods are extended to deal with time and change. We offer a new solution to these problems, based on a theory of partitions of reality wh...
162
click to vote
AUTOMATICA
2004
15 years 6 months ago
2004
This paper addresses the optimal control problem of the continuous-time piecewise affine (PWA) systems with autonomous switching executed at each sampling time, which we call sampl...