1092 search results - page 57 / 219 » Polynomial Interpretations and the Complexity of Algorithms |
133
click to vote
IJCAI
1997
15 years 7 months ago
1997
Although it is acknowledged that multi-way dataflow constraints are useful in interactive applications, concerns about their tractability have hindered their acceptance. Certain l...
153
Voted
AIPS
2009
15 years 7 months ago
2009
A planning problem is k-dependent if each action has at most k pre-conditions on variables unaffected by the action. This concept is well-founded since k is a constant for all but...
196
click to vote
SIAMDM
2008
15 years 5 months ago
2008
We introduce two variants of proper colorings with imposed partial ordering on the set of colors. One variant shows very close connections to some fundamental problems in graph the...
140
click to vote
IPPS
2000
IEEE
15 years 10 months ago
2000
IEEE
We consider technology mapping from factored form binary leaf-DAG to lookup tables LUTs , such as those found in eld programmable gate arrays. Polynomial time algorithms exist f...
139
click to vote
APWEB
2008
Springer
15 years 7 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...