2766 search results - page 366 / 554 » Algorithms for trigonometric polynomials |
147
Voted
AIPS
2007
15 years 6 months ago
2007
We present three new complexity results for classes of planning problems with simple causal graphs. First, we describe a polynomial time algorithm that uses macros to generate pla...
130
click to vote
DLOG
2007
15 years 6 months ago
2007
We present a query answering technique based on notions and results from modal Correspondence Theory. It allows us to answer a wide family of conjunctive queries by polynomial redu...
113
click to vote
FLAIRS
2008
15 years 6 months ago
2008
In this paper we describe a class of a problem of goal satisfaction in mutual exclusion network that can be solved in polynomial time. This problem provides a common basis for rea...
142
click to vote
FLAIRS
2008
15 years 6 months ago
2008
Handling exceptions represents one of the most important problems in Artificial Intelligence. Several approaches have been proposed for reasoning on default theories. This paper f...
115
click to vote
APWEB
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. One of the emerging concepts in microdata protection is kanonymity, introduced by Samarati and Sweeney. k-anonymity provides a simple and efficient approach to protect pr...