Sciweavers

15254 search results - page 34 / 3051
» A k
Sort
View
PODC
1999
ACM
14 years 2 months ago
On k-Set Consensus Problems in Asynchronous Systems
ÐIn this paper, we investigate the k-set consensus problem in asynchronous distributed systems. In this problem, each participating process begins the protocol with an input value...
Roberto De Prisco, Dahlia Malkhi, Michael K. Reite...
ADBIS
2007
Springer
256views Database» more  ADBIS 2007»
14 years 1 months ago
Adaptive k-Nearest-Neighbor Classification Using a Dynamic Number of Nearest Neighbors
Classification based on k-nearest neighbors (kNN classification) is one of the most widely used classification methods. The number k of nearest neighbors used for achieving a high ...
Stefanos Ougiaroglou, Alexandros Nanopoulos, Apost...
JANCL
2006
105views more  JANCL 2006»
13 years 9 months ago
BDD-based decision procedures for the modal logic K
We describe BDD-based decision procedures for the modal logic K. Our approach is inspired by the automata-theoretic approach, but we avoid explicit automata construction. Instead, ...
Guoqiang Pan, Ulrike Sattler, Moshe Y. Vardi
QUESTA
2000
68views more  QUESTA 2000»
13 years 9 months ago
Ergodicity of the BMAP/PH}/s/s+K retrial queue with PH-retrial times
Define the traffic intensity as the ratio of the arrival rate to the service rate. This paper shows that the BMAP/PH/s/s+K retrial queue with PH-retrial times is ergodic if and onl...
Qi-Ming He, Hui Li, Yiqiang Q. Zhao
COLOGNETWENTE
2010
13 years 6 months ago
A Branch-and-price Approach to the k-Clustering Minimum Biclique Completion Problem
Given a bipartite graph G = (S, T, E), we consider the problem of finding k bipartite subgraphs, called "clusters", such that each vertex i of S appears in exactly one o...
Stefano Gualandi, Francesco Maffioli, Claudio Magn...