2905 search results - page 153 / 581 » Formal Memetic Algorithms |
106
Voted
STTT
2008
15 years 2 months ago
2008
Abstract. This paper shows how a formal method in the form of Coloured Petri Nets (CPNs) and the supporting CPN Tools have been used in the development of the Course of Action Sche...
199
Voted
WWW
2003
ACM
16 years 3 months ago
2003
ACM
More and more resources are becoming available on the Web, and there is a growing need for infrastructures that, based on advertised descriptions, are able to semantically match d...
217
Voted
POPL
2004
ACM
16 years 2 months ago
2004
ACM
We prove the decidability of the quantifier-free, static fragment of ambient logic, with composition adjunct and iteration, which corresponds to a kind of regular expression langu...
139
Voted
ICFCA
2009
Springer
15 years 9 months ago
2009
Springer
Matrix decomposition methods provide representations of an object-variable data matrix by a product of two different matrices, one describing relationship between objects and hidd...
126
click to vote
WAIM
2005
Springer
15 years 8 months ago
2005
Springer
It is well known that a formal framework for the schema matching problem (SMP) is important because it facilitates the building of algorithm model and the evaluation of algorithms....