Sciweavers

1982 search results - page 31 / 397
» Designing Efficient Distributed Algorithms Using Sampling Te...
Sort
View
INFORMATICALT
2006
88views more  INFORMATICALT 2006»
14 years 9 months ago
Improving the Performances of Asynchronous Algorithms by Combining the Nogood Processors with the Nogood Learning Techniques
Abstract. The asynchronous techniques that exist within the programming with distributed constraints are characterized by the occurrence of the nogood values during the search for ...
Ionel Muscalagiu, Vladimir Cretu
PODC
2010
ACM
14 years 11 months ago
Brief announcement: efficient graph algorithms without synchronization
We give a graph decomposition technique that creates entirely independent subproblems for graph problems such as coloring and dominating sets that can be solved without synchroniz...
Johannes Schneider, Roger Wattenhofer
JCB
2006
140views more  JCB 2006»
14 years 9 months ago
HAPLOFREQ-Estimating Haplotype Frequencies Efficiently
A commonly used tool in disease association studies is the search for discrepancies between the haplotype distribution in the case and control populations. In order to find this d...
Eran Halperin, Elad Hazan
ICCAD
2008
IEEE
127views Hardware» more  ICCAD 2008»
15 years 6 months ago
Design and optimization of a digital microfluidic biochip for protein crystallization
Proteins crystallization is a commonly used technique for protein analysis and subsequent drug design. It predicts the three-dimensional arrangement of the constituent amino acids...
Tao Xu, Krishnendu Chakrabarty, Vamsee K. Pamula
97
Voted
ALT
1997
Springer
15 years 1 months ago
Learning One-Variable Pattern Languages Very Efficiently on Average, in Parallel, and by Asking Queries
A pattern is a string of constant and variable symbols. The language generated by a pattern is the set of all strings of constant symbols which can be obtained from by substituti...
Thomas Erlebach, Peter Rossmanith, Hans Stadtherr,...