Sciweavers

145 search results - page 4 / 29
» The Maximum Distinguishing Number of a Group
Sort
View
CEEMAS
2005
Springer
14 years 29 days ago
The "Dance or Work" Problem: Why Do not all Honeybees Dance with Maximum Intensity
A honeybee colony has to choose among several nectar sources in the environment, each fluctuating in quality over time. Successful forager bees return to the hive and perform dance...
Ronald Thenius, Thomas Schmickl, Karl Crailsheim
QSIC
2005
IEEE
14 years 1 months ago
Stochastic Voting Algorithms for Web Services Group Testing
This paper proposes a stochastic voting for testing a large number of Web Services (WS) under group testing. In the future, a large number of WS will be available and they need to...
Wei-Tek Tsai, Dawei Zhang, Raymond A. Paul, Yinong...
AICCSA
2005
IEEE
104views Hardware» more  AICCSA 2005»
14 years 1 months ago
Multicast address management in the Internet: a study of the port blocking problem
A critical issue in multicast communication is how to identify multicast groups. In the Internet, multicast addresses and port numbers distinguish multicast groups from each other...
Emad Eldin Mohamed, Hussein M. Abdel-Wahab, I. Sal...
TKDE
2012
245views Formal Methods» more  TKDE 2012»
11 years 9 months ago
Semi-Supervised Maximum Margin Clustering with Pairwise Constraints
—The pairwise constraints specifying whether a pair of samples should be grouped together or not have been successfully incorporated into the conventional clustering methods such...
Hong Zeng, Yiu-ming Cheung
TSP
2008
118views more  TSP 2008»
13 years 7 months ago
Maximum-Likelihood Detection of Orthogonal Space-Time Block Coded OFDM in Unknown Block Fading Channels
For orthogonal space-time block coded orthogonal frequency division multiplexing (OSTBC-OFDM) systems, many of the existing blind detection and channel estimation methods rely on t...
Tsung-Hui Chang, Wing-Kin Ma, Chong-Yung Chi