224 search results - page 27 / 45 » Homogeneous Decomposition of Polynomials |
ICRA
2007
IEEE
14 years 5 months ago
2007
IEEE
— Distributed motion planning of multiple agents raises fundamental and novel problems in control theory and robotics. Recently, one such great challenge has been the development...
RSA
2008
13 years 10 months ago
2008
We present an expected polynomial time algorithm to generate an unlabeled connected cubic planar graph uniformly at random. We first consider rooted connected cubic planar graphs, ...
CSCLP
2005
Springer
14 years 4 months ago
2005
Springer
Abstract. Among, Common and Disjoint are global constraints useful in modelling problems involving resources. We study a number of variations of these constraints over integer and ...
ANTS
2010
Springer
14 years 2 months ago
2010
Springer
Let p be a rational prime and let Φ(X) be a monic irreducible polynomial in Z[X], with nΦ = deg Φ and δΦ = vp(disc Φ). In [13] Montes describes an algorithm for the decomposi...
WDAG
2007
Springer
14 years 5 months ago
2007
Springer
We study adaptive routing algorithms in a round-based model. Suppose we are given a network equipped with load-dependent latency functions on the edges and a set of commodities eac...