2905 search results - page 352 / 581 » Formal Memetic Algorithms |
175
click to vote
SAS
1994
Springer
15 years 8 months ago
1994
Springer
Amtoft has formulated an "on-line" constraint normalization method for solving a strictness inference problem inspired by Wright. From the syntactic form of the normaliz...
148
click to vote
FMCAD
2004
Springer
15 years 7 months ago
2004
Springer
This work presents a memory-efficient All-SAT engine which, given a propositional formula over sets of important and non-important variables, returns the set of all the assignments...
135
click to vote
FORMATS
2006
Springer
15 years 7 months ago
2006
Springer
Current numerical model checkers for stochastic systems can efficiently analyse stochastic models. However, the fact that they are unable to provide debugging information constrain...
145
Voted
ISEMANTICS
2010
15 years 5 months ago
2010
In this paper, when we use the term ontology, we are primarily referring to linked data in the form of RDF(S). The problem of ontology mapping has attracted considerable attention...
231
click to vote
FOSSACS
2011
Springer
14 years 7 months ago
2011
Springer
Traditional automata accept or reject their input, and are therefore Boolean. In contrast, weighted automata map each word to a value from a semiring over a large domain. The speci...