299 search results - page 4 / 60 » Dispositional implementation solves the superfluous structur... |
ISHPC
1997
Springer
15 years 3 months ago
1997
Springer
Abstract. Writing e cient iterative solvers for irregular, sparse matrices in HPF is hard. The locality in the computations is unclear, and for e ciency we use storage schemes that...
ISSAC
2005
Springer
15 years 5 months ago
2005
Springer
This paper presents a duality analysis and an algorithm for computing the multiplicity structure of a zero to a polynomial system, while the zero can be exact or approximate with ...
TRANSCI
2011
14 years 6 months ago
2011
This paper presents a dynamic (or multi-period) hub location problem. It proposes a branch-and-bound algorithm that uses a Lagrangean relaxation to obtain lower and upper bounds a...
JAIR
2008
14 years 11 months ago
2008
In the efficient social choice problem, the goal is to assign values, subject to side constraints, to a set of variables to maximize the total utility across a population of agent...
ISPA
2005
Springer
15 years 5 months ago
2005
Springer
Since cognition could be treated as problem-solving issues based on dynamical knowledge transferring and propagation, the meta-learning and group learning are put forward in confor...