Sciweavers

3454 search results - page 269 / 691
» Modern computer algebra
Sort
View
TJS
2008
78views more  TJS 2008»
15 years 6 months ago
A performance study of multiprocessor task scheduling algorithms
Abstract Multiprocessor task scheduling is an important and computationally difficult problem. A large number of algorithms were proposed which represent various tradeoffs between ...
Shiyuan Jin, Guy A. Schiavone, Damla Turgut
JC
2007
119views more  JC 2007»
15 years 6 months ago
Factoring bivariate sparse (lacunary) polynomials
We present a deterministic algorithm for computing all irreducible factors of degree ≤ d of a given bivariate polynomial f ∈ K[x, y] over an algebraic number field K and their...
Martin Avendano, Teresa Krick, Martín Sombr...
JSC
2007
72views more  JSC 2007»
15 years 6 months ago
Linear syntax for communicating elementary mathematics
We consider computer aided assessment (CAA) of mathematics in which a student provides an answer in the form of a mathematical expression. A common approach is for CAA system impl...
Christopher J. Sangwin, P. Ramsden
SIAMCOMP
2002
153views more  SIAMCOMP 2002»
15 years 6 months ago
A Decision Procedure for Unitary Linear Quantum Cellular Automata
Linear quantum cellular automata were introduced recently as one of the models of quantum computing. A basic postulate of quantum mechanics imposes a strong constraint on any quan...
Christoph Dürr, Miklos Santha
CASC
2010
Springer
151views Mathematics» more  CASC 2010»
15 years 5 months ago
Supporting Global Numerical Optimization of Rational Functions by Generic Symbolic Convexity Tests
Convexity is an important property in nonlinear optimization since it allows to apply efficient local methods for finding global solutions. We propose to apply symbolic methods t...
Winfried Neun, Thomas Sturm, Stefan Vigerske