Sciweavers

6102 search results - page 1087 / 1221
» Generating Optimizing Specializers
Sort
View
134
Voted
CORR
2010
Springer
101views Education» more  CORR 2010»
15 years 5 months ago
Probing Capacity
We consider the problem of optimal probing of states of a channel by transmitter and receiver for maximizing rate of reliable communication. The channel is discrete memoryless (DM...
Himanshu Asnani, Haim H. Permuter, Tsachy Weissman
CORR
2008
Springer
97views Education» more  CORR 2008»
15 years 5 months ago
Efficient Algorithms and Routing Protocols for Handling Transient Single Node Failures
Single node failures represent more than 85% of all node failures in the today's large communication networks such as the Internet [10]. Also, these node failures are usually...
Amit M. Bhosle, Teofilo F. Gonzalez
ESWA
2008
162views more  ESWA 2008»
15 years 5 months ago
Proportionate flexible flow shop scheduling via a hybrid constructive genetic algorithm
The proportionate flow shop (PFS) is considered as a unique case of the flow shop problem in which the processing times of the operations belonging to the same job are equal. A pr...
Der-Fang Shiau, Shu-Chen Cheng, Yueh-Min Huang
136
Voted
BMCBI
2006
84views more  BMCBI 2006»
15 years 4 months ago
Representation of target-bound drugs by computed conformers: implications for conformational libraries
Background: The increasing number of known protein structures provides valuable information about pharmaceutical targets. Drug binding sites are identifiable and suitable lead com...
Stefan Günther, Christian Senger, Elke Michal...
CJ
2006
123views more  CJ 2006»
15 years 4 months ago
Unconditionally Secure Anonymous Encryption and Group Authentication
Anonymous channels or similar techniques that can achieve sender's anonymity play important roles in many applications. However, they will be meaningless if cryptographic prim...
Goichiro Hanaoka, Junji Shikata, Yumiko Hanaoka, H...
« Prev « First page 1087 / 1221 Last » Next »