Sciweavers

28888 search results - page 87 / 5778
» Computability and complexity in analysis
Sort
View
JDCTA
2010
228views more  JDCTA 2010»
13 years 2 months ago
Research and Progress of Cluster Algorithms based on Granular Computing
Granular Computing (GrC), a knowledge-oriented computing which covers the theory of fuzzy information granularity, rough set theory, the theory of quotient space and interval comp...
Shifei Ding, Li Xu, Hong Zhu, Liwen Zhang
RTSS
2007
IEEE
14 years 2 months ago
Adapting Futures: Scalability for Real-World Computing
Creating robust real-time embedded software is critical in combining the physical world with computing, such as in consumer electronics or robotics. One challenge is the complexit...
Johannes Helander, Risto Serg, Margus Veanes, Prit...
CIBCB
2006
IEEE
14 years 2 months ago
A Systematic Computational Approach for Transcription Factor Target Gene Prediction
— Computational prediction of transcription factor’s binding sites and regulatory target genes has great value to the biological studies of cellular process. Existing practices...
Ji He, Xinbin Dai, Xuechun Zhao
SIGDOC
2005
ACM
14 years 1 months ago
Animating pervasive computing
It is difficult to present new, complex ideas in ways that are informative and interesting in situations where a vast amount of information has to be delivered and understood quic...
Andrée Woodcock, John R. Burns, Sarah Mount...
CP
2007
Springer
13 years 12 months ago
Efficient Computation of Minimal Point Algebra Constraints by Metagraph Closure
Abstract. Computing the minimal network (or minimal CSP) representation of a given set of constraints over the Point Algebra (PA) is a fundamental reasoning problem. In this paper ...
Alfonso Gerevini, Alessandro Saetti