Sciweavers

549 search results - page 21 / 110
» Using Formal Concept Analysis in Mathematical Discovery
Sort
View
WEBI
2005
Springer
15 years 7 months ago
Efficient Extraction of Closed Motivic Patterns in Multi-Dimensional Symbolic Representations of Music
In this paper, we present an efficient model for discovering repeated patterns in symbolic representations of music. Combinatorial redundancy inherent to the pattern discovery pa...
Olivier Lartillot
CEC
2011
IEEE
14 years 1 months ago
Cost-benefit analysis of using heuristics in ACGP
—Constrained Genetic Programming (CGP) is a method of searching the Genetic Programming search space non-uniformly, giving preferences to certain subspaces according to some heur...
John W. Aleshunas, Cezary Z. Janikow
HYBRID
1992
Springer
15 years 5 months ago
A Formal Approach to Computer Systems Requirements Documentation
This paper demonstrates how the extended duration calculus [4] can be used to support the approach to documentation of computer systems presented by in [1]. This approach uses the ...
Marcin Engel, Marcin Kubica, Jan Madey, David Lorg...
IEE
2008
115views more  IEE 2008»
15 years 2 months ago
Faithful mapping of model classes to mathematical structures
ion techniques are indispensable for the specification and verification of functional behavior of programs. In object-oriented ation languages like JML, a powerful abstraction tec...
Ádám Darvas, Peter Müller
ICFCA
2009
Springer
15 years 6 months ago
Handling Large Formal Context Using BDD - Perspectives and Limitations
This paper presents Binary Decision Diagrams (BDDs) applied to Formal Concept Analysis (FCA). The aim is to increase the FCA capability to handle large formal contexts. The main id...
Andrei Rimsa, Luis E. Zárate, Mark A. J. So...