2905 search results - page 311 / 581 » Formal Memetic Algorithms |
119
Voted
IV
2008
IEEE
15 years 10 months ago
2008
IEEE
Given a group of overlapping sets, it is not always possible to represent it with Euler diagrams. Euler diagram characteristics might collide with the sets relationships to depict...
115
click to vote
LICS
2008
IEEE
15 years 10 months ago
2008
IEEE
This paper is an investigation of the matching problem for term equations s = t where s contains context variables, and both terms s and t are given using some kind of compressed ...
146
click to vote
LICS
2008
IEEE
15 years 10 months ago
2008
IEEE
Tait’s method (a.k.a. proof by logical relations) is a powerful proof technique frequently used for showing foundational properties of languages based on typed λ-calculi. Histo...
117
Voted
AI
2008
Springer
15 years 10 months ago
2008
Springer
Modularization entails more efficient reasoning and better performance in the ontology manipulation process. Therefore, the development of modular ontologies has recently received ...
119
Voted
CEC
2007
IEEE
15 years 10 months ago
2007
IEEE
— We present an ant model that solves a discrete foraging problem. We describe simulations and provide a complete convergence analysis: we show that the ant population computes t...