461 search results - page 24 / 93 » Practical polynomial factoring in polynomial time |
DLOG
2011
14 years 1 months ago
2011
We show that deciding conjunctive query inseparability for OWL 2 QL ontologies is PSpace-hard and in ExpTime. We give polynomial-time (incomplete) algorithms and demonstrate by exp...
AIPS
2010
14 years 12 months ago
2010
Factored planning methods aim to exploit locality to efficiently solve large but "loosely coupled" planning problems by computing solutions locally and propagating limit...
COCOON
2005
Springer
15 years 3 months ago
2005
Springer
In this paper, we study the following disc covering problem: Given a set of discs of various radii on the plane, find a subset of discs to maximize the area covered by exactly on...
AAAI
2012
13 years 1 days ago
2012
We consider the classic cake cutting problem where one allocates a divisible cake to n participating agents. Among all valid divisions, fairness and efficiency (a.k.a. social wel...
DAC
2001
ACM
15 years 10 months ago
2001
ACM
An approach for factoring general boolean functions was described in [15, 16] which is based on graph partitioning algorithms. In this paper, we present a very fast algorithm for ...