Sciweavers

5510 search results - page 345 / 1102
» Mathematics
Sort
View
ISSAC
1997
Springer
157views Mathematics» more  ISSAC 1997»
15 years 11 months ago
On the Worst-case Complexity of Integer Gaussian Elimination
Gaussian elimination is the basis for classical algorithms for computing canonical forms of integer matrices. Experimental results have shown that integer Gaussian elimination may...
Xin Gui Fang, George Havas
CONCUR
1993
Springer
15 years 11 months ago
Loop Parallelization in the Polytope Model
During the course of the last decade, a mathematical model for the parallelization of FOR-loops has become increasingly popular. In this model, a (perfect) nest of r FOR-loops is r...
Christian Lengauer
ISSAC
1994
Springer
102views Mathematics» more  ISSAC 1994»
15 years 11 months ago
An Application of Symbolic Computation in the Physical Sciences
An example of a problem in the physical sciences is discussed where application of various symbolic computation facilities available in many algebraic computing systems leads to a...
Charles C. Dyer
MAAMAW
1994
Springer
15 years 11 months ago
Towards a Theory of Cooperative Problem Solving
One objective of distributed artificial intelligence research is to build systems that are capable of cooperative problem solving. To this end, a number of implementation-oriented ...
Michael Wooldridge, Nicholas R. Jennings
SAS
1994
Springer
136views Formal Methods» more  SAS 1994»
15 years 11 months ago
Constraint-Based Type Inference and Parametric Polymorphism
Constraint-based analysis is a technique for inferring implementation types. Traditionally it has been described using mathematical formalisms. We explain it in a different and mor...
Ole Agesen