11808 search results - page 103 / 2362 » Isometries and Computability Structures |
110
click to vote
ISSAC
2007
Springer
15 years 9 months ago
2007
Springer
Approximate symbolic computation problems can be formulated as constrained or unconstrained optimization problems, for example: GCD [3, 8, 12, 13, 23], factorization [5, 10], and ...
123
click to vote
ISMIS
2003
Springer
15 years 8 months ago
2003
Springer
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...
100
click to vote
EGC
2005
Springer
15 years 8 months ago
2005
Springer
Quantitative Structure Activity/Property Relationship (QSAR/QSPR) model development is a complex and time-consuming procedure involving data gathering and preparation. It plays an ...
100
click to vote
ISMB
2000
15 years 4 months ago
2000
The repetitive structure of genomic DNA holds many secrets to be discovered. A systematic study of repetitive DNA on a genomic or inter-genomic scale requires extensive algorithmi...