Sciweavers

778 search results - page 125 / 156
» Bounding Smooth Integers
Sort
View
ACTA
2005
104views more  ACTA 2005»
13 years 7 months ago
Optimal recovery schemes in fault tolerant distributed computing
Clusters and distributed systems offer fault tolerance and high performance through load sharing. When all n computers are up and running, we would like the load to be evenly distr...
Kamilla Klonowska, Håkan Lennerstad, Lars Lu...
ALGORITHMICA
2005
97views more  ALGORITHMICA 2005»
13 years 7 months ago
Representing Trees of Higher Degree
This paper focuses on space efficient representations of rooted trees that permit basic navigation in constant time. While most of the previous work has focused on binary trees, w...
David Benoit, Erik D. Demaine, J. Ian Munro, Rajee...
IPL
2007
76views more  IPL 2007»
13 years 7 months ago
Minimum cost subpartitions in graphs
Given an edge-weighted graph G = (V,E), a subset S ⊆ V , an integer k 1 and a real b 0, the minimum subpartition problem asks to find a family of k nonempty disjoint subsets X1...
Hiroshi Nagamochi, Yoko Kamidoi
JCO
2007
97views more  JCO 2007»
13 years 7 months ago
Restricted domination parameters in graphs
In a graph G, a vertex dominates itself and its neighbors. A subset S ⊆ V (G) is an m-tuple dominating set if S dominates every vertex of G at least m times, and an m-dominating...
Wayne Goddard, Michael A. Henning
COMBINATORICS
2004
102views more  COMBINATORICS 2004»
13 years 7 months ago
Satisfiability and Computing van der Waerden Numbers
In this paper we bring together the areas of combinatorics and propositional satisfiability. Many combinatorial theorems establish, often constructively, the existence of positive...
Michael R. Dransfield, Lengning Liu, Victor W. Mar...