3415 search results - page 561 / 683 » Lower Bounds for Kernelizations |
117
click to vote
COMPGEOM
1995
ACM
15 years 7 months ago
1995
ACM
Abstract. We show that there is a matching between the edges of any two triangulations of a planar point set such that an edge of one triangulation is matched either to the identic...
144
click to vote
DAC
1995
ACM
15 years 7 months ago
1995
ACM
In this paper we present a set cover based approach (SCP) to multi-way partitioning for minimum delay for Look-Up Table based FPGAs. SCP minimizes the number of chip-crossings on ...
130
click to vote
ICDCS
1995
IEEE
15 years 7 months ago
1995
IEEE
Protocols that provide reliable communicationon top of a network that can lose packets rely on periodically retransmitting packets. The choice of retransmission timeout critically...
131
click to vote
LICS
1997
IEEE
15 years 7 months ago
1997
IEEE
We consider a class of infinite two-player games on finitely coloured graphs. Our main question is: given a winning condition, what is the inherent blow-up (additional memory) of ...
125
click to vote
WG
1995
Springer
15 years 7 months ago
1995
Springer
Abstract. In this paper, we investigate which processor networks allow klabel Interval Routing Schemes, under the assumption that costs of edges may vary. We show that for each xed...