1275 search results - page 211 / 255 » time 1998 |
SCP
1998
13 years 8 months ago
1998
Consistency techniques are an e cient way of tackling constraint satisfaction problems (CSP). In particular, various arc-consistency algorithms have been designed such as the time...
SIAMCOMP
1998
13 years 8 months ago
1998
We consider the problem of maintaining a dynamic planar graph subject to edge insertions and edge deletions that preserve planarity but that can change the embedding. We describe a...
SIAMDM
1998
13 years 8 months ago
1998
The richest class of t-perfect graphs known so far consists of the graphs with no so-called odd-K4. Clearly, these graphs have the special property that they are hereditary t-perfe...
SIGMETRICS
1998
ACM
13 years 8 months ago
1998
ACM
The increasing complexity of computer networks and our increasing dependence on them means enforcing reliability requirements is both more challenging and more critical. The expan...
SIGOPS
1998
13 years 8 months ago
1998
Abstract: The undergraduate operating systems course can provide students with a valuable introduction to empirical testing and experimentation. This paper announces the availabili...