Sciweavers

2989 search results - page 195 / 598
» Using Domain-Independent Problems for Introducing Formal Met...
Sort
View
79
Voted
FUZZIEEE
2007
IEEE
15 years 4 months ago
Towards Fuzzy Compositional Modelling
Compositional Modelling (CM) has been applied to synthesize automatically plausible scenarios in many problem domains with promising results. However, it is assumed that the generi...
Xin Fu, Qiang Shen, Ruiqing Zhao
101
Voted
ACSC
2005
IEEE
15 years 3 months ago
Integer Programming Models and Algorithms for Molecular Classification of Cancer from Microarray Data
Novel, high-throughput technologies are challenging the core of algorithmic methods available in Computer Science. Microarray technologies give Life Sciences researchers the oppor...
Regina Berretta, Alexandre Mendes, Pablo Moscato
98
Voted
EWDW
1990
15 years 2 months ago
Semantics of Object-Oriented Data Models - The Evolving Algebra Approach
The formal description of the semantics of object-oriented data models is still an open problem. Some characteristic features of object-oriented data models, such as methods and i...
Georg Gottlob, Gerti Kappel, Michael Schrefl
122
Voted
DAC
1994
ACM
15 years 1 months ago
Probabilistic Analysis of Large Finite State Machines
Regarding nite state machines as Markov chains facilitates the application of probabilistic methods to very large logic synthesis and formal veri cation problems. Recently, we ha...
Gary D. Hachtel, Enrico Macii, Abelardo Pardo, Fab...
72
Voted
DLT
2004
14 years 11 months ago
An Efficient Pattern Matching Algorithm on a Subclass of Context Free Grammars
There is a close relationship between formal language theory and data compression. Since 1990's various types of grammar-based text compression algorithms have been introduced...
Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda