Sciweavers

3356 search results - page 119 / 672
» Determining Consensus Numbers
Sort
View
DM
2007
119views more  DM 2007»
13 years 10 months ago
Short proofs for cut-and-paste sorting of permutations
We consider the problem of determining the maximum number of moves required to sort a permutation of [n] using cut-and-paste operations, in which a segment is cut out and then pas...
Daniel W. Cranston, Ivan Hal Sudborough, Douglas B...
SYNTHESE
2008
83views more  SYNTHESE 2008»
13 years 10 months ago
A relativistic Zeno effect
A Zenonian supertask involving an infinite number of identical colliding balls is generalized to include balls with different masses. Under the restriction that the total mass of a...
David Atkinson
IJUFKS
2007
108views more  IJUFKS 2007»
13 years 10 months ago
Resampling for Fuzzy Clustering
Abstract. Resampling methods are among the best approaches to determine the number of clusters in prototype-based clustering. The core idea is that with the right choice for the nu...
Christian Borgelt
TC
2008
13 years 10 months ago
Localized Broadcasting with Guaranteed Delivery and Bounded Transmission Redundancy
The common belief is that localized broadcast algorithms are not able to guarantee both full delivery and a good bound on the number of transmissions. In this paper, we propose the...
Majid Khabbazian, Vijay K. Bhargava
JCO
2007
130views more  JCO 2007»
13 years 10 months ago
On edge orienting methods for graph coloring
We consider the problem of orienting the edges of a graph so that the length of a longest path in the resulting digraph is minimum. As shown by Gallai, Roy and Vitaver, this edge ...
Bernard Gendron, Alain Hertz, Patrick St-Louis