Sciweavers

8825 search results - page 90 / 1765
» All for one or one for all
Sort
View
EJC
2006
15 years 1 months ago
Toward the classification of Moufang loops of order 64
We show how to obtain all nonassociative Moufang loops of order less than 64 and 4262 nonassociative Moufang loops of order 64 in a unified way. We conjecture that there are no oth...
Petr Vojtechovský
JSC
2006
132views more  JSC 2006»
15 years 1 months ago
From an approximate to an exact absolute polynomial factorization
We propose an algorithm for computing an exact absolute factorization of a bivariate polynomial from an approximate one. This algorithm is based on some properties of the algebrai...
Guillaume Chèze, André Galligo
BMCBI
2005
89views more  BMCBI 2005»
15 years 1 months ago
MILANO - custom annotation of microarray results using automatic literature searches
Background: High-throughput genomic research tools are becoming standard in the biologist's toolbox. After processing the genomic data with one of the many available statisti...
Ran Rubinstein, Itamar Simon
JAR
1998
57views more  JAR 1998»
15 years 27 days ago
Signed Systems for Paraconsistent Reasoning
In [6] Besnard and Schaub elaborated a novel approach to paraconsistent reasoning which lead to a family of paraconsistent consequence relations. In a sense these try to safeguard...
Philippe Besnard, Torsten Schaub
JUCS
2010
124views more  JUCS 2010»
14 years 11 months ago
Finding a Consistent Scenario to an Interval Algebra Network Containing Possibly Infinite Intervals
: Interval algebra networks are traditionally defined over finite intervals. In this paper, we relax this restriction by allowing one or more of the intervals involved to be infini...
André Trudel