Sciweavers

Share
HPDC
2011
IEEE
9 years 2 months ago
Algorithm-based recovery for iterative methods without checkpointing
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...
Zizhong Chen
SIAMCO
2011
9 years 5 months ago
Consistency of Sequential Bayesian Sampling Policies
We consider Bayesian information collection, in which a measurement policy collects information to support a future decision. This framework includes ranking and selection, continu...
Peter Frazier, Warren B. Powell
GC
2010
Springer
9 years 9 months ago
Degree Bounded Spanning Trees
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...
Jun Fujisawa, Hajime Matsumura, Tomoki Yamashita
COMBINATORICA
2007
117views more  COMBINATORICA 2007»
9 years 10 months ago
Embedding nearly-spanning bounded degree trees
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...
Noga Alon, Michael Krivelevich, Benny Sudakov
ASPDAC
2006
ACM
133views Hardware» more  ASPDAC 2006»
10 years 4 months ago
Monotonic parallel and orthogonal routing for single-layer ball grid array packages
— 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...
Yoichi Tomioka, Atsushi Takahashi
MICAI
2007
Springer
10 years 4 months ago
On Reachability of Minimal Models of Multilattice-Based Logic Programs
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...
Jesús Medina, Manuel Ojeda-Aciego, Jorge Ru...
ESA
2009
Springer
98views Algorithms» more  ESA 2009»
10 years 5 months ago
Reconstructing 3-Colored Grids from Horizontal and Vertical Projections Is NP-hard
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...
Christoph Dürr, Flavio Guiñez, Mart&ia...
books