HPDC
2011
IEEE
12 years 8 months ago
2011
IEEE
In today’s high performance computing practice, fail-stop failures are often tolerated by checkpointing. While checkpointing is a very general technique and can often be applied...
SIAMCO
2011
12 years 12 months ago
2011
We consider Bayesian information collection, in which a measurement policy collects information to support a future decision. This framework includes ranking and selection, continu...
GC
2010
Springer
13 years 3 months ago
2010
Springer
In this paper, we give a sufficient condition for a graph to have a degree bounded spanning tree. Let n ≥ 1, k ≥ 3, c ≥ 0 and G be an n-connected graph. Suppose that for eve...
COMBINATORICA
2007
13 years 4 months ago
2007
We derive a sufficient condition for a sparse graph G on n vertices to contain a copy of a tree T of maximum degree at most d on (1 − )n vertices, in terms of the expansion prop...
ASPDAC
2006
ACM
13 years 11 months ago
2006
ACM
— In this paper, we give the necessary and sufficient condition that all nets can be connected by monotonic routes when a net consists of a finger and a ball and fingers are on...
MICAI
2007
Springer
13 years 11 months ago
2007
Springer
In this paper some results are obtained regarding the existence and reachability of minimal fixed points for multiple-valued functions on a multilattice. The concept of inf-preser...
ESA
2009
Springer
13 years 11 months ago
2009
Springer
We consider the problem of coloring a grid using k colors with the restriction that in each row and each column has an specific number of cells of each color. In an already classi...