2783 search results - page 221 / 557 » The Nature Of Near-Synonymic Relations |
JC
2006
15 years 1 months ago
2006
We prove upper bounds on the order and degree of the polynomials involved in a resolvent representation of the prime differential ideal associated with a polynomial differential s...
110
click to vote
JDWM
2006
15 years 1 months ago
2006
This paper focuses on the discovery of surprising, unexpected patterns, based on a data mining method that consists of detecting instances of Simpson's paradox. By its very n...
116
click to vote
JODS
2006
15 years 1 months ago
2006
Abstract. We study the exchange of information in collective information systems mediated by information agents, focusing specifically on the problem of semantic interoperability. ...
COMBINATORICS
2004
15 years 1 months ago
2004
The Sandwich Theorems proved in this paper give a new method to show that the partition function a(n) of a partition identity A(x) := n=0 a(n)xn = n=1 (1 - xn )-p(n) satisfies t...
118
click to vote
IJSIR
2010
14 years 8 months ago
2010
It is known that the most common versions of particle swarm optimization (PSO) algorithms are rotationally variant. It has also been pointed out that PSO algorithms can concentrat...