Sciweavers

2647 search results - page 27 / 530
» Solving Term Inequalities
Sort
View
CORR
1998
Springer
105views Education» more  CORR 1998»
13 years 10 months ago
Solving Degenerate Sparse Polynomial Systems Faster
Abstract. Consider a system F of n polynomial equations in n unknowns, over an algebraically closed field of arbitrary characteristic. We present a fast method to find a point in...
J. Maurice Rojas
AUTOMATICA
2007
72views more  AUTOMATICA 2007»
13 years 11 months ago
A probabilistic analytic center cutting plane method for feasibility of uncertain LMIs
ust control problems can be formulated in abstract form as convex feasibility programs, where one seeks a solution x that satisfies a set of inequalities of the form F . = {f (x,...
Giuseppe C. Calafiore, Fabrizio Dabbene
CONSTRAINTS
2002
107views more  CONSTRAINTS 2002»
13 years 10 months ago
Fourier Elimination for Compiling Constraint Hierarchies
Linear equality and inequality constraints arise naturally in specifying many aspects of user interfaces, such as requiring that one window be to the left of another, requiring tha...
Warwick Harvey, Peter J. Stuckey, Alan Borning
ICRA
2003
IEEE
225views Robotics» more  ICRA 2003»
14 years 4 months ago
Post-stabilization for rigid body simulation with contact and constraints
— Rigid body dynamics with contact constraints can be solved locally using linear complementarity techniques. However, these techniques do not impose the original constraints and...
Michael B. Cline, Dinesh K. Pai
SODA
2004
ACM
58views Algorithms» more  SODA 2004»
14 years 7 days ago
Point containment in the integer hull of a polyhedron
We show that the point containment problem in the integer hull of a polyhedron, which is defined by m inequalities, with coefficients of at most bits can be solved in time O(m + ...
Ernst Althaus, Friedrich Eisenbrand, Stefan Funke,...