73 search results - page 8 / 15 » Origins of the Calculus of Binary Relations |
GRC
2007
IEEE
14 years 1 months ago
2007
IEEE
The original rough set model is concerned primarily with the approximation of sets described by single binary relation on the universe. In the view of granular computing, classica...
FOSSACS
2005
Springer
14 years 27 days ago
2005
Springer
Abstract. Nominal logic is a variant of first-order logic equipped with a “freshname quantifier” N and other features useful for reasoning about languages with bound names. I...
TABLEAUX
1999
Springer
13 years 11 months ago
1999
Springer
We combine techniques originally developed for refutational first-order theorem proving within the clause tree framework with techniques for minimal model computation developed wi...
CEC
2010
IEEE
13 years 8 months ago
2010
IEEE
The Nelder-Mead Algorithm (NMA) is an almost half-century old method for numerical optimization, and it is a close relative of Particle Swarm Optimization (PSO) and Differential Ev...
CORR
2010
Springer
13 years 2 months ago
2010
Springer
The concept of effective complexity of an object as the minimal description length of its regularities has been initiated by Gell-Mann and Lloyd. The regularities are modeled by m...