Sciweavers

1805 search results - page 257 / 361
» A Theory of Closure Operators
Sort
View
AI
2006
Springer
15 years 4 months ago
Backward-chaining evolutionary algorithms
Starting from some simple observations on a popular selection method in Evolutionary Algorithms (EAs)--tournament selection--we highlight a previously-unknown source of inefficien...
Riccardo Poli, William B. Langdon
FSS
2006
140views more  FSS 2006»
15 years 4 months ago
Advances and challenges in interval-valued fuzzy logic
Among the various extensions to the common [0, 1]-valued truth degrees of "traditional" fuzzy set theory, closed intervals of [0, 1] stand out as a particularly appealin...
Chris Cornelis, Glad Deschrijver, Etienne E. Kerre
JACM
2000
131views more  JACM 2000»
15 years 4 months ago
The soft heap: an approximate priority queue with optimal error rate
A simple variant of a priority queue, called a soft heap, is introduced. The data structure supports the usual operations: insert, delete, meld, and findmin. Its novelty is to beat...
Bernard Chazelle
NDJFL
1998
105views more  NDJFL 1998»
15 years 4 months ago
Idempotent Full Paraconsistent Negations are not Algebraizable
Using methods of abstract logic and the theory of valuation, we prove that there is no paraconsistent negation obeying the law of double negation and such that ¬(a ∧ ¬a) is a t...
Jean-Yves Béziau
164
Voted
OR
2002
Springer
15 years 4 months ago
Copulae as a new tool in financial modelling
The paper presents an overview of financial applications of copulas. Copulas permit to represent joint distribution functions by splitting the marginal behavior, embedded in the ma...
Elisa Luciano, Marina Marena