1552 search results - page 37 / 311 » On the Complexity of Constant Propagation |
EOR
2007
15 years 1 months ago
2007
Academic subjects made judgmental forecasts of a graphically presented time series in a laboratory experiment. Besides the past realizations of the time series itself, the only av...
116
click to vote
APPROX
2009
Springer
15 years 8 months ago
2009
Springer
We give the first constant factor approximation algorithm for the asymmetric Virtual Private Network (Vpn) problem with arbitrary concave costs. We even show the stronger result, ...
100
click to vote
AIPS
2009
15 years 3 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...
119
click to vote
ACTA
2007
15 years 2 months ago
2007
Abstract Computing frequent itemsets is one of the most prominent problems in data mining. Recently, a new related problem, called FREQSAT, was introduced and studied: given some i...
128
click to vote
TCS
2008
15 years 1 months ago
2008
In evaluating the performance of online algorithms for search trees, one wants to compare them to the best offline algorithm available. In this paper we lower bound the cost of an...