Sciweavers

3378 search results - page 45 / 676
» A universe of binding and computation
Sort
View
75
Voted
GECCO
2005
Springer
140views Optimization» more  GECCO 2005»
15 years 3 months ago
MDGA: motif discovery using a genetic algorithm
Computationally identifying transcription factor binding sites in the promoter regions of genes is an important problem in computational biology and has been under intensive resea...
Dongsheng Che, Yinglei Song, Khaled Rasheed
ISMIS
2003
Springer
15 years 2 months ago
Granular Computing Based on Rough Sets, Quotient Space Theory, and Belief Functions
Abstract. A model of granular computing (GrC) is proposed by reformulating, re-interpreting, and combining results from rough sets, quotient space theory, and belief functions. Two...
Y. Y. Yao, Churn-Jung Liau, Ning Zhong
COMPGEOM
1989
ACM
15 years 1 months ago
Computing Partial Sums in Multidimensional Arrays
d Abstract) Bernard Chazelle Burton Rosenberg Department of Computer Science Princeton University
Bernard Chazelle, Burton Rosenberg
FGCS
2010
126views more  FGCS 2010»
14 years 8 months ago
Perspectives on grid computing
Grid computing has been the subject of many large national and international IT projects in the past. However, it seems that the general expectations in Grids have not come true. ...
Uwe Schwiegelshohn, Rosa M. Badia, Marian Bubak, M...