1291 search results - page 91 / 259 » Computing the multiplicity structure in solving polynomial s... |
114
click to vote
TROB
2008
15 years 1 months ago
2008
Distributed motion planning of multiple agents raises fundamental and novel problems in control theory and robotics. In particular, in applications such as coverage by mobile senso...
129
Voted
ATAL
2007
Springer
15 years 8 months ago
2007
Springer
Distributed Constraint Optimization (DCOP) is a general framework that can model complex problems in multi-agent systems. Several current algorithms that solve general DCOP instan...
ECAI
2006
Springer
15 years 5 months ago
2006
Springer
Abstract. In human-like reasoning it often happens that different conditions, partially alternative and hierarchically structured, are mentally grouped in order to derive some conc...
116
click to vote
FOCS
2009
IEEE
15 years 8 months ago
2009
IEEE
We prove that QIP(2), the class of problems having two-message quantum interactive proof systems, is a subset of PSPACE. This relationship is obtained by means of an efficient pa...
101
click to vote
ISSAC
2005
Springer
15 years 7 months ago
2005
Springer
Let G = (4y2 + 2z)x2 + (10y2 + 6z) be the greatest common divisor (gcd) of two polynomials A, B ∈ [x,y, z]. Because G is not monic in the main variable x, the sparse modular ...