Sciweavers

281 search results - page 4 / 57
» Solving Parametric Algebraic Systems
Sort
View
ISSAC
2005
Springer
125views Mathematics» more  ISSAC 2005»
14 years 28 days ago
Generalized normal forms and polynomial system solving
This paper describes a new method for computing the normal form of a polynomial modulo a zero-dimensional ideal I. We give a detailed description of the algorithm, a proof of its ...
Bernard Mourrain
IPPS
2000
IEEE
13 years 11 months ago
A Framework for Embedded Real-Time System Design
This paper describes a framework for parametric analysis of real-time systems based on process algebra. The Algebra of Communicating Shared Resources ACSR has been extended to AC...
Jin-Young Choi, Hee-Hwan Kwak, Insup Lee
CC
2005
Springer
115views System Software» more  CC 2005»
14 years 29 days ago
Experiences with Enumeration of Integer Projections of Parametric Polytopes
Abstract. Many compiler optimization techniques depend on the ability to calculate the number of integer values that satisfy a given set of linear constraints. This count (the enum...
Sven Verdoolaege, Kristof Beyls, Maurice Bruynoogh...
DCC
2008
IEEE
14 years 7 months ago
On solving sparse algebraic equations over finite fields
A system of algebraic equations over a finite field is called sparse if each equation depends on a small number of variables. Finding efficiently solutions to the system is an unde...
Igor Semaev
AIED
2007
Springer
14 years 1 months ago
Benefits of Handwritten Input for Students Learning Algebra Equation Solving
Building on past results establishing a benefit for using handwriting when entering mathematics on the computer, we hypothesize that handwriting as an input modality may be able to...
Lisa Anthony, Jie Yang, Kenneth R. Koedinger