299 search results - page 4 / 60 » Optimizing Polynomial Solvers for Minimal Geometry Problems |
AIPS
2008
13 years 9 months ago
2008
We present a faster method of solving optimal planning problems and show that our solution performs up to an order of magnitude faster than Satplan on a variety of problems from t...
IMR
2003
Springer
14 years 21 days ago
2003
Springer
The quality of numerical simulations of processes that are modeled by partial differential equations strongly depends on the quality of the mesh that is used for their discretiza...
DATE
2002
IEEE
14 years 14 days ago
2002
IEEE
Abstract—Antenna problem is a phenomenon of plasma-induced gateoxide degradation. It directly affects manufacturability of very large scale integration (VLSI) circuits, especiall...
DM
2010
13 years 7 months ago
2010
Let H 2V be a hypergraph on vertex set V . For a positive integer r, we call H r-exact, if any minimal transversal of H intersects any hyperedge of H in at most r vertices. This ...
CORR
2011
Springer
12 years 11 months ago
2011
Springer
One can reduce the problem of proving that a polynomial is nonnegative, or more generally of proving that a system of polynomial inequalities has no solutions, to finding polynomi...