8298 search results - page 31 / 1660 » On the Complexity of Numerical Analysis |
CP
1999
Springer
15 years 2 months ago
1999
Springer
Reformulating constraint satisfaction problems (CSPs) in lower arity is a common procedure when computing consistency. Lower arity CSPs are simpler to treat than high arity CSPs. ...
113
click to vote
SP
2002
IEEE
14 years 9 months ago
2002
IEEE
When Java was first introduced, there was a perception that its many benefits came at a significant performance cost. In the particularly performance-sensitive field of numerical ...
AAAI
1998
14 years 11 months ago
1998
This paper introduces a newwayof accelerating the convergenceof numericCSPfiltering algorithms, through the use of extrapolation methotis. Extrapolation methodsare used in numeric...
65
Voted
CORR
2010
Springer
14 years 10 months ago
2010
Springer
Fixpoint Computations with Numerical Acceleration Methods Olivier Bouissou1 , Yassamine Seladji1 CEA, LIST, Laboratory for the Modeling and Analysis of Interacting Systems 91191 Gi...
JOCN
2010
14 years 8 months ago
2010
or the Abstract Representation of Numerical Magnitude Ian D. Holloway1,2 and Daniel Ansari1,2 use number is an abstract quality of a set, the way in which a number is externally r...