166 search results - page 33 / 34 » Resultants of partially composed polynomials |
COMPGEOM
2009
ACM
14 years 8 days ago
2009
ACM
We consider the following combinatorial problem: given a set of n objects (for example, disks in the plane, triangles), and an integer L ≥ 1, what is the size of the smallest su...
CAEPIA
2005
Springer
13 years 11 months ago
2005
Springer
Conformant planning is a variation of classical AI planning where the initial state is partially known and actions can have nondeterministic effects. While a classical plan must a...
COMPGEOM
2003
ACM
13 years 11 months ago
2003
ACM
We introduce a new realistic input model for geometric graphs and nonconvex polyhedra. A geometric graph G is local if (1) the longest edge at every vertex v is only a constant fa...
IJCAI
2003
13 years 7 months ago
2003
There is controversy as to whether explicit support for PDDL-like axioms and derived predicates is needed for planners to handle real-world domains effectively. Many researchers h...
MP
1998
13 years 5 months ago
1998
We consider the polyhedral approach to solving the capacitated facility location problem. The valid inequalities considered are the knapsack, ow cover, e ective capacity, single d...