Sciweavers

2194 search results - page 6 / 439
» Improving HLRTA*( k )
Sort
View
OPODIS
2010
13 years 7 months ago
Self-stabilizing (k, r)-Clustering in Wireless Ad-hoc Networks with Multiple Paths
Abstract. Wireless Ad-hoc networks are distributed systems that often reside in error-prone environments. Self-stabilization lets the system recover autonomously from an arbitrary ...
Andreas Larsson, Philippas Tsigas
ICALP
1999
Springer
14 years 2 months ago
On the Complements of Partial k-Trees
We introduce new techniques for studying the structure of partial k-trees. In particular, we show that the complements of partial k-trees provide an intuitively-appealing character...
Arvind Gupta, Damon Kaller, Thomas C. Shermer
SIAMDM
2008
118views more  SIAMDM 2008»
13 years 9 months ago
Ramsey-Type Problem for an Almost Monochromatic K4
In this short note we prove that there is a constant c such that every k-edge-coloring of the complete graph Kn with n 2ck contains a K4 whose edges receive at most two colors. Th...
Jacob Fox, Benny Sudakov
COCOA
2008
Springer
13 years 11 months ago
New Algorithms for k-Center and Extensions
The problem of interest is covering a given point set with homothetic copies of several convex containers C1,...,Ck, while the objective is to minimize the maximum over the dilatat...
René Brandenberg, Lucia Roth
PR
2008
88views more  PR 2008»
13 years 9 months ago
Modified global k
Clustering in gene expression data sets is a challenging problem. Different algorithms for clustering of genes have been proposed. However due to the large number of genes only a ...
Adil M. Bagirov